I was asked to populate the next right pointer in a binary tree.
Anonymous
First I used queues but was asked to further optimize it such that it consumes O(1) extra space. Was asked to write the codes for both of them.
Check out your Company Bowl for anonymous work chats.