Introduction - If you have any usage issues, please Google them yourself
Process the data in a tree structure as its data structure. Concrete, used the binary sort tree. Binary sort tree or an empty tree, or the nature of the binary tree with the following: (1) if it s left subtree is not empty, then the left sub-tree of all nodes is less than the value of its root point value (2) if it s right subtree is not empty, then the right sub-tree value of all the nodes were larger than the value of its root node (3) around its subtree are also binary sort tree.
Packet : 45666011txiangguan.rar filelist
txiangguan\程序代码.txt
txiangguan\对二叉排序树T作相关操作n.doc
txiangguan