AVL (Balance Tree) C ++ code (non-recursion)

CodeMoved to the Binary Search Tree Code. The required resources are divided into 0.

Resource Description

1. There is an old AVL Tree Code in it.
2. It mainly consists of Binary Search Tree Code based on the C ++ template technology, including
AVL, BST, RBT, SBT, splay, and treap.
3. The Code is based on a bst_base to implement commonAlgorithm. The Object Features and storage structure are passed up through template parameters to implement special algorithms. In the end, different trees only need to maintain their own things. On this basis, the Code implements map, set and its corresponding structures that allow multiple identical keys. The Code contains the VC10 project, and compiled by GCC (mingw), and has the corresponding DEMO code.