Introduction - If you have any usage issues, please Google them yourself
generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.
Packet : 9927404genbst.rar filelist
genBST\BSTNode.h
genBST\Debug
genBST\genBST.dsp
genBST\genBST.dsw
genBST\genBST.h
genBST\genBST.ncb
genBST\genBST.opt
genBST\genBST.plg
genBST\main.cpp
genBST