ALWAYS REMEMBER: BALANCED BINARY SEARCH TREE = AVL TREE

Note: Binary Search Tree and Balanced Binary Search Tree is 2 different things. All Binary Search Tree need not be Balanced however the vice versa is TRUE.

The worst case running time to search for an element in a balanced binary search tree with n elements is log(n) because Balanced search tree have height logn