- Category:
- Other systems
- Tags:
-
- File Size:
- 56kb
- Update:
- 2018-05-26
- Downloads:
- 0 Times
- Uploaded by:
- zjuzxm
Description: An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| Full_Vertexs_Edges_Test.c | 897 | 2017-12-07
|
| Full_Vertexs_Edges_Test.exe | 31112 | 2018-01-12
|
| Full_Vertexs_Edges_Test.txt | 43135 | 2017-12-07
|
| project3.c | 4709 | 2017-12-07
|
| project3.exe | 73490 | 2018-01-12
|
| project3_source.c | 7946 | 2017-12-07 |
Download