A utility function to find leftmost node in a binary tree rooted with ' root ' . This function is used in inOrder ( )
Node * leftMost ( Node * root ) { while ( root != NULL && root -> left != NULL ) root = root -> left ; return root ; }