Description: A two - fork sort tree or an empty tree, or a two - fork tree with the following properties:
(1) if the left subtree is not empty, the value of all the nodes on the left subtree is less than or equal to the value of its root node.
(2) if the right subtree is not empty, the value of all the nodes on the right subtree is greater than or equal to the value of its root node.
(3) the left and right subtrees are also two forked trees, respectively.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 实验5\BinaryTree.cpp | 786 | 2017-11-16
|
| 实验5\BinaryTree.exe | 401193 | 2017-11-16
|
| 实验5\BinaryTree.h | 4087 | 2017-11-16
|
| 实验5\BinaryTree.h.gch | 1175812 | 2017-11-16
|
| 实验5 |
Download