A utility function to find leftmost node in a binary tree rooted with ' root ' . This function is used in inOrder ( )
def leftMost ( root ) : NEW_LINE INDENT while root != None and root . left != None : NEW_LINE INDENT root = root . left NEW_LINE DEDENT return root NEW_LINE DEDENT