1
Q
What does this prevent?
A
Prevents the binary tree from ending up like a straight line/ending up like a linked list again where every element ends up on one side of the initial node.
2
Q
What is the concept?
A
The height on the left and right of any given node has a height difference of no more than 1. This goes for every node on the tree, not just the starting node.
