Find the Deepest Left Node in a Binary Tree. | Algorithms
Given a binary tree, Find the deepest left node in it. the node which is left child and at the last level in the tree is called deepest left node. Same way we can find the deepest right node in the tree.