110 likes | 427 Views
AVL Trees. And the pain you must suffer to learn them. The AVL Property. For every node the left and right side differ in height by less than two. The left and right side are themselves AVL trees. How Balanced is That?. AVL trees might end up kinda 'sparse'.
E N D
AVL Trees And the pain you must suffer to learn them
The AVL Property • For every node the left and right side differ in height by less than two. • The left and right side are themselves AVL trees.
How Balanced is That? • AVL trees might end up kinda 'sparse'. • The worst case height of an AVL tree with n nodes is about 1.44log(n). • Discussion at http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/AVL.html
Rotations • Rotations are to rearrange nodes to maintain AVLness. • They are needed on insert and delete.
Names of Rotations • There are four of them • Single Left (LL) and Single Right (RR) • Double Left (LR) and Double Right (RL) • The names describe which way the node moves. For example, a left rotation moves the node down and left. • Nodes always move down when rotated.
A Left Rotation via Pointers temp=p->right ; p->right=temp->left ; temp->left=p ; p=temp ;
Double Rotation • A LR double rotation is to rotate something to the left, and then its former parent to the right. • A RL double rotation is to rotate something to the right, and then its former parent to the left.
Rotation Examples • All the rotations in picture form http://sky.fit.qut.edu.au/~maire/avl/System/AVLTree.html • All the rotations in pictures and text http://www.cs.jcu.edu.au/Subjects/cp2001/1997/foils/balancedTrees/balancedTrees.html • Sample single and double rotationshttp://ironbark.bendigo.latrobe.edu.au/courses/subjects/DataStructures/mal/session200/lecture.html
The AVL Insertion Algorithm • An Intuitive description can be found at http://www.ucfv.bc.ca/cis/watkissc/200009/200009Comp175/notes/avlTrees.html
The AVL Game • Play the game http://www.seanet.com/users/arsen/avltree.html