顺序方式存储的完全二叉树进行重建
题目描述
按顺序方式存储的一棵完全二叉树的结点记录，结点个数为n。根据所输入的顺序结构的结点记录建立二叉树，输出树的先序，中序和后序遍历结果。
注：数字“0”表示不存在此结点，没有孩子结点。
输入
树结点个数n
顺序方式存储的完全二叉树
输出
先序遍历输出
中序遍历输出
后序遍历输出
样例输入
10
1 2 0 3 4 0 0 5 6 7
样例输出
1 2 3 5 6 4 7
5 3 6 2 7 4 1
5 6 3 7 4 2 1(Title Descr iption
The node record of a complete two - fork tree is stored in a sequential way, with a node number of n. The two forked tree is set up according to the node record of the input sequence structure. The first order, the middle order and the post order of the output tree are traversed.
Note: the number "0" indicates that there is no such node and there is no child node.
input
The number of tree nodes n
A complete two forked tree stored in a sequential way
output
Preface ergodic output
Middle sequence ergodic output
Post sequence ergodic output
sample input
Ten
1203400567
sample output
1235647
5362741
5637421)