After Inserting 41
AVL Tree Example
Here we have inserted 41. The A node is the root of the
whole tree. We update the intervening 0 factor nodes (37, 52, and 49),
then 68 gets factor +2. Since the insert point is left, right, left
from A, we use the LR(b) transform. A = 68, B = 37, C = 52
The C node becomes the root of the tree, and the A node
(the old root) moves right.
