Description: Insertion node in the balanced binary sort tree BBST insert a new data element e removed nodes removed node insertion process and the operation of similar nodes, the basic process is: a balanced binary tree, find the node you want to delete, delete a nodes, into a binary tree, rotation, turned back into a balanced binary tree. Find the given value to compare with the root node, if the value is greater than a given root node to find its right subtree is less than the search for its left subtree, and so on.
To Search:
- [bank] - Simple banking simulation program, hope
- [TREE] - Tree branch relations are defined hierar
File list (Check if you may need any files):
tree\二叉树报告.doc
....\平衡二叉树的演示.cpp
tree
Download