Description: (1) Enter the character sequence of binary list. (2) in traversing Binary: recursive algorithm. (3) in traversing Binary: non-recursive algorithm. (Best to achieve the first-order, post-order non-recursive algorithm) (4) Find the height of the binary tree. (5) Find the number of leaves of a binary tree. (6) to establish inorder threaded binary and achieve the in-order traversal. (8) by means of the queue level traversal of a binary tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
To Search:
File list (Check if you may need any files):
The tree.doc
Download