Given a binary tree. How would you check each node given only a check left and check right methods.
Anonymous
Using a queue. For each node, check left and right and add the next nodes to the queue as necessary.
Check out your Company Bowl for anonymous work chats.