Balanced Binary Search Tree

A Balanced Binary Search Tree is a Binary Search Tree which has a height of $O(\log n)$ nodes, where $n$ is the total number of nodes.

In practice, this means the difference between the heights of the Left sub-tree and Right sub-tree must be no more than $1$ in height.