Sketch a left rotation on an AVL.  build the following AVL tree: insert 5 insert 2 insert 7 insert 9 insert 11  follow the insert algorithm draw out the original tree prior to any rotations -which node breaks the avl condition -label N, R, A, B, C, and the parent of N. -draw out the final tree

C++ 

Sketch a left rotation on an AVL. 

build the following AVL tree:

insert 5
insert 2
insert 7
insert 9
insert 11

 follow the insert algorithm

draw out the original tree prior to any rotations
-which node breaks the avl condition
-label N, R, A, B, C, and the parent of N.
-draw out the final tree after any rotation