← Questions
Populate next right pointers in each node
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Each node of a binary tree (not necessarily perfect) has a next pointer. Set every node's next to the node to its right on the same level, or null at the end of a level. Follow-up: use constant extra space.
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