This tree is not balanced:
In the worst case, an unbalanced tree's height is n-1 and searching for an element in it takes O(n) time.
