Populate next pointers in a perfect binary tree
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.
MicrosoftCodingNo answer yet. Write the first one; the best answer gets endorsed.