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