- Category:
- Other systems
- Tags:
-
- File Size:
- 16kb
- Update:
- 2017-12-25
- Downloads:
- 0 Times
- Uploaded by:
- 蒋
Description: Title Description
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
To Search:
File list (Check if you may need any files):
Filename | Size | Date |
---|
问题 J.docx | 19360 | 2017-10-25 |