Balance

A Balanced tree is a tree which has a height of $O(logn)$ 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.