考察树的遍历
题目大意:
用栈来模拟一颗二叉树的先序和中序的遍历过程,求这颗二叉树的后序遍历序列
思路:
入栈序列对应二叉树的先序遍历,出栈序列对应二叉树的中序遍历
由中序+先序可以确定唯一一颗二叉树
sample input中的push次序1,2,3,4,5,6 先序遍历序列 1,2,3,4,5,6
sample input中的pop次序二3,2,4,1,6,5 中序遍历序列为3,2,4,1,6,5
则由此建立二叉树,然后输出其后序遍历序列
建立方法
先序头节点为树的跟节点,以此将中序序列分成左右两个部分,计算左右子树节点的个数,递归建立树
node* creat(int preL,int preR,int inL,int R){
if(preL>preR)return NULL;//递归结束条件,先序序列长度<0
node* root =new node;
root->data=pre[preL];
int k;
for(int i=inL;k<=inR;k++){
if(in[k]==pre[preL])break;
}
int numLeft=k-inL;//左子树节点的个数
root->lchild=creat(preL+1,preL+numLeft,inL,k-1);
root->rchild=creat(preL+numLeft+1,preR,k+1,inR);
return root;
}
AC代码:
//1086 Tree Traversals Again (25 分)
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
const int maxn = 50;
struct node {
int data;
node* lchild;
node* rchild;
};
int pre[maxn], in[maxn], post[maxn];
int n, num = 0;
node* creat(int preL, int preR, int inL, int inR) {
if (preL > preR)return NULL;
node* root = new node;
root->data = pre[preL];
int k;
for (k = inL; k <= inR; k++) {
if (in[k] == pre[preL])break;
}
int numleft = k - inL;
root->lchild = creat(preL + 1, preL + numleft, inL, k - 1);
root->rchild = creat(preL + numleft + 1, preR, k + 1, inR);
return root;
}
void postorder(node* root) {
if (root == NULL) return;
postorder(root->lchild);
postorder(root->rchild);
printf("%d", root->data);
num++;
if (num < n)printf(" ");
}
int main() {
(void)scanf("%d", &n);
char str[5];
stack<int>st;
int x, preIndex = 0, inIndex = 0;
for (int i = 0; i < 2 * n; i++) {
(void)scanf("%s", str);
if (strcmp(str, "Push") == 0) {
(void)scanf("%d", &x);
pre[preIndex++] = x;
st.push(x);
}
else {
in[inIndex++] = st.top();
st.pop();
}
}
node* root = creat(0, n - 1, 0, n - 1);
postorder(root);
return 0;
}