Description: AVL tree realization: avl tree is left to each node subtree and right subtree height difference up to 1 binary search tree. a height of at least h of AVL tree nodes from S (h) = S (h-1)+ S (h-2)+ 1 received. avl tree to ensure that any one node subtree about the difference between the height of the absolute value of not more than one (empty tree for high-definition 1). in the insertion and deleted when you need according to the circumstances of the tree node to do some adjustments
- [AVLtree.Rar] - AVL Tree and the creation of basic opera
- [FlyServer] - Console server category IOCPServer sampl
- [Linux_study] - Linux important orders, can help beginne
- [avltree] - complete source code for avl tree
- [Avl_tree] - it s hard to say
File list (Check if you may need any files):
Download