Description: 1. This procedure demonstration balanced binary tree insertion, delete, find,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call about a balanced analysis of function and rotating functions, balanced binary tree update delete elements have to call after the balance analysis functions and rotation function, update the balance tree. 4. Balanced binary tree can be the basis of the search algorithm to find. Relatively simple.
To Search:
- [balanetree] - data structure design-- achieving a bala
- [BSTree] - Procedures, including the balanced binar
- [AVT] - Balanced binary tree data structure is a
File list (Check if you may need any files):
平衡二叉树
..........\Debug
..........\PHECS.cpp
..........\PHECS.dsp
..........\PHECS.dsw
..........\PHECS.exe
..........\PHECS.ncb
..........\PHECS.opt
..........\PHECS.plg
..........\平衡二叉树.doc
Download