Problem Recursive Solution This problem is somewhat like BFS, except that we need to examine every node on the same level before expanding. Since the first element of a level is a left child of some node, first traverse down the left subtrees and store the values. Then examine the right nodes while coming back up. After coming back to the root, go to the right subtree and examine the left nodes ..
