Populate next right pointers in each node
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.
MetaTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.