Description: (1) the input character sequence, the establishment of binary list.
(2) traverse the binary output.
(3) Please design an algorithm, requiring the algorithm to the binary tree leaf nodes from left to right together into a single linked list, the first table pointer to head. Binary tree by binary list stored, the link with the leaf nodes of the right to store a single pointer field list pointers. Please traverse the linked list out all the leaf nodes, and then all of a preorder traversal of binary output leaf node, and compare the two outputs to see if the same.
(4) try to write an algorithm to determine whether a binary tree is complete binary tree.
(5) try to write an algorithm to determine whether a binary tree is a binary search tree.
(6) in the main function in a simple menu design, debugging the algorithm, respectively.
To Search:
File list (Check if you may need any files):
demo.doc
Download