Take a look at this Binary Tree:
What is it called when a Binary Tree has at most 1 in difference between its
left and right subtree heights, for each node in the tree?
In such cases, we say that
the Binary Tree is @(8).
In such cases, we say that
the Binary Tree is balanced.
In such cases, we say that
the Binary Tree is Balanced.