1127 ZigZagging on a Tree (30 point(s))
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-order. However, if you think the problem is too simple, then you are too naive. This time you are supposed to print the numbers in "zigzagging order" -- that is, starting from the root, print the numbers level-by-level, alternating between left to right and right to left. For example, for the following tree you must output: 1 11 5 8 17 12 20 15.
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 inorder sequence and the third line gives the postorder sequence. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the zigzagging sequence of the tree in a line. 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:
8
12 11 20 17 1 15 8 5
12 20 17 11 15 8 5 1
Sample Output:
1 11 5 8 17 12 20 15
题目大意:给一个后序和中序序列,让你进行S形遍历输出
分析:1) 后序和中序建树(各种建树考频也太高了)
2)dfs中序深度递归(刚好符合从左到右或从右到左的顺序),用邻接表结构保存每一层结点
3)输出
#include<bits/stdc++.h>
using namespace std;
const int maxn=31;
struct node{
int data;
node *l,*r;
};
int post[maxn],in[maxn],n;
node *creat(int postl,int postr,int inl,int inr){
if(postl>postr){
return NULL;
}
node *root=new node;
root->data=post[postr];
int k;
for( k=inl;k<=inr;k++){
if(in[k]==post[postr])
break;
}
int leftnum=k-inl;
root->l =creat(postl,postl+leftnum-1,inl,k-1);
root->r =creat(postl+leftnum,postr-1,k+1,inr);
return root;
}
int maxdepth=0;
vector<int>v[100];
void dfs(node *root,int depth){
if(!root){
maxdepth=max(depth,maxdepth);
return ;
}
dfs(root->l,depth+1);
v[depth].push_back(root->data);
dfs(root->r,depth+1);
}
int main(){
cin>>n;
for(int i=0;i<n;i++) cin>>in[i];
for(int i=0;i<n;i++) cin>>post[i];
//这里太坑了,题目给的后序和中序序列,然后我就想当然的以为先读后序再读入中序,所以题目要看清
node *root=creat(0,n-1,0,n-1);
dfs(root,0);
// cout<<maxdepth<<endl;
cout<<root->data;
for(int i=1;i<maxdepth;i++){
if(i%2){
for(int j=0;j<v[i].size();j++){
cout<<" "<<v[i][j];
}
}else{
for(int j=v[i].size()-1;j>=0;j--){
cout<<" "<<v[i][j];
}
}
}
cout<<endl;
return 0;
}
上一篇:层次遍历和后序遍构建二叉树