The data values in a binary search tree obey the binary search tree property: For a node, \(\mathtt{u}\), every data value stored in the subtree rooted at \(\texttt{u.left}\) is less than \(\texttt{u....The data values in a binary search tree obey the binary search tree property: For a node, \(\mathtt{u}\), every data value stored in the subtree rooted at \(\texttt{u.left}\) is less than \(\texttt{u.x}\) and every data value stored in the subtree rooted at \(\texttt{u.right}\) is greater than \(\texttt{u.x}\). Without knowing more about the shape of the tree it is difficult to say much about the length of this path, except that it is less than \(\mathtt{n}\), the number of nodes in the tree.
