← Questions
Populate next pointers in a perfect binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
In a perfect binary tree, set each node's next pointer to the node to its right on the same level, or null at the end of a level. Do it with O(1) extra space by walking each level through the next pointers you already set.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding