Driver program to test above function
root = Node ( 1 ) NEW_LINE root . left = Node ( 2 ) NEW_LINE root . right = Node ( 3 ) NEW_LINE root . left . left = Node ( 4 ) NEW_LINE root . right . left = Node ( 5 ) NEW_LINE root . right . right = Node ( 6 ) NEW_LINE root . right . left . right = Node ( 7 ) NEW_LINE root . right . right . right = Node ( 8 ) NEW_LINE root . right . left . right . left = Node ( 9 ) NEW_LINE root . right . right . right . right = Node ( 10 ) NEW_LINE result = deepestLeftLeaf ( root ) NEW_LINE if result is None : NEW_LINE INDENT print " There ▁ is ▁ not ▁ left ▁ leaf ▁ in ▁ the ▁ given ▁ tree " NEW_LINE DEDENT else : NEW_LINE INDENT print " The ▁ deepst ▁ left ▁ child ▁ is " , result . val NEW_LINE DEDENT