##
Depth of the deepest odd level node in Binary Tree
January 17, 2017

Given a Binary tree, find out depth of the deepest odd level leaf node. Take root level as depth 1. Examples: Input : Output : 5 We can traverse the tree starting from the root level and keep curr_level of the node. Increment the curr_level each time we go to left or a right subtree.… Read More »