For any binary search tree $($BST$)$ T and any node u in T$,$ we define the size of

u as the number of nodes in the subtree rooted at u$,$ we define the rank of u as the base$-2$ logarithm of the

size of u$,$ and we define the potential of T as the sum of the ranks of all nodes in T$.$