• height of tree (node (lv, ll, lr)) > (height of tree right) + 1
• height of tree ll < height of tree lr

then result of balancing the tree (node (v, (node (lv, ll, lr)), right)) = result of rotating (node (v, (node (lv, ll, lr)), right)) twice