Introduction - If you have any usage issues, please Google them yourself
THUEE four experimental data and algorithms: a keyword all nodes by binary file input, which keywords are an integer, binary search tree structure to enhance and statistical story of the tree, according to the requirements of the output to a file the. 2, given two enhanced binary search tree P and T, judging from the shape (without considering node key value) P is equal to T in a sub-tree, that T contains P. (Preferably in the form of a binary tree can be realized for any comparison is not limited to a binary search tree)