1020. Tree Traversals (25)
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.
Sample Input:7 2 3 1 5 7 6 4 1 2 3 4 5 6 7Sample Output:
4 1 6 3 5 7 2
这题是通过后序和中序遍历,求层次遍历,情况和前序和中序相似,不会同学可以通过前序和中序借鉴一下。
#include<iostream> #include<algorithm> #include<vector> using namespace std; typedef struct node{ int num; struct node* left; struct node* right; }treeNode; int in[100],post[100]; vector<int>level(10000,-1); int ma=0; void create_tree(int root,int l,int r,int index) { if(r<l) return ; int i=l; while(i<r&&in[i]!=post[root])i++; level[index]=post[root]; create_tree(root-1-r+i,l,i-1,2*index+1); create_tree(root-1,i+1,r,2*index+2); } int main(){ int n; cin>>n; for(int i=0;i<n;i++) cin>>post[i]; for(int i=0;i<n;i++) cin>>in[i]; create_tree(n-1,0,n-1,0); int num=0; for(int i=0;i<level.size();i++) if(level[i]!=-1&&num!=n-1){ cout<<level[i]<<" "; num++; } else if(level[i]!=-1){ cout<<level[i]<<endl; break; } system("pause"); return 0; }