Flip a binary tree upside down and return an array of nodes (which are the new heads)
Anonymous
I used recursion for this question, but failed to remember to pass the data structure itself in the parameters for the function, and so I ultimately was unable to make a working solution.
Check out your Company Bowl for anonymous work chats.