Thursday, August 23, 2012

AVL tree rotation!!!

AVL tree is balanced binary search tree. When we try to add new node to the AVL tree, it may become un-balanced. Generally the node which is unbalanced is grand parent of the newly inserted node. To balance the AVL tree, we need to do rotations. There are two types of rotations.

No comments:

Popular Posts