Description: Title 4. Binary Sort Tree Establishment, insert, delete, and search are given a set of key values, the establishment of the corresponding binary sort tree to complete: ⑴ node deletion. Requirements can delete root node, leaf nodes, as well as other arbitrary node function ⑵ insert a new node operation ⑶ value given in the binary sort tree to find ⑷ at any time show the results of operations.
To Search:
File list (Check if you may need any files):
新建 Microsoft Word 文档.doc
Download