Description: Description of the problem: there is a given n the binary tree nodes, the nodes numbered 1,2, ..., n. Known number of tree nodes in the sequence after the sequence and form, try to design an algorithm to determine the binary tree before the node numbering sequence table. Experimental task: the binary tree for a given number of nodes in the sequence after the sequence and form, the calculation of the binary tree before the node numbering sequence table.
To Search:
File list (Check if you may need any files):
S010600917
..........\postin.c
..........\postin.ppt
..........\postin.rar
Download