
FREE C PROGRAMSData Structures and C Programming 
DATA STRUCTURES USING C 
Data Structures Interview Questions
Pg : 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 AVL TreeAn AVL tree is a special type of binary tree that is always partially balanced. The criteria that is used to determine the level of balancedness is the difference between the heights of subtrees of a root in the tree. The height of tree is the number of levels in the tree. Or to be more formal, the height of a tree is defined as follows:
Height of a node
AVL trees are heightbalanced binary search treesBalance factor of a nodeheight(left subtree)  height(right subtree) An AVL tree has balance factor calculated at every nodeFor every node, heights of left and right subtree can differ by no more than 1 Store current heights in each node
Animated AVL Tree
http://www.cs.jhu.edu/~goodrich/dsa/trees/avltree.html
Notes on AVL Trees
http://pages.cs.wisc.edu/~siff/CS367/Notes/AVLs/
AVL Tree Rotations Tutorial
http://fortheloot.com/public/AVLTreeTutorial.rtf
AVL Tree C Program
http://www.freecprograms.com/AVL.htm
 
