Description: (1) Enter the sequence of characters, build binary list. (2) binary tree traversal output. (3) design an algorithm, the algorithm requires the leaf nodes of a binary tree from left to right together into a single list, table pointer for the head. Binary stored by binary list, to store a single list pointer pointer field with the right leaf node link. Please traverse the list to output all the leaf nodes, and then output the first tree traversal of all leaf nodes, and compare the results of two outputs, to see whether the same. (4) Try to write an algorithm to determine whether a binary tree is a complete binary tree. (5) Try to write an algorithm to determine whether a binary tree is a binary sort tree. (6) Design a simple menu in the main function, namely to debug these algorithms.
To Search:
File list (Check if you may need any files):
FUJIAN3.cpp
Download