Description: 1. The establishment of binary list.
Requirements: preorder traversal according to the rules of binary continuous input from the keyboard of the first-order sequence, without the child node, then instead of using* to show the location of a null pointer.
2. First-order, postorder recursive algorithm to the list in front of the establishment of good binary tree traversal. Requests were displayed after the node traversal sequence.
3. Call calculated the leaf nodes binary tree algorithm is, statistics list the above-mentioned binary tree, the total number of leaf nodes from the screen display binary tree list the total number of leaf nodes.
4. Design an algorithm, seeking value in a binary tree node x, the layer where the layer number.
To Search:
File list (Check if you may need any files):
BiTNode\实验五.Cpp
BiTNode
Download