Description: Known a sort tree, the tree nodes in the form: data info left right one, data given node data field, info given in the left sub-tree nodes in the total number of nodes, left and nodes are given the right the left and right son of the son' s address. Data field data and the type of info are all int. It is known that the binary sort tree root node' s address root. Please design two functions, namely to achieve the following functions: 1. By increasing order to find the binary sort tree nodes i-small. 2. Insert data field of the value of x nodes, and should maintain the binary sort tree, the nature of the change.
To Search:
File list (Check if you may need any files):
作业3.cpp
Download