A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which the vertices of a binary tree can be systematically traversed or ordered. They are preorder, inorder and postorder. Let T be a binary tree with root r and subtrees T1,T2.
In a preorder traversal of the vertices of T, we visit the root r followed by visiting the vertices of T1 in preorder, then the vertices of T2 in preorder.
In an inorder traversal of the vertices of T, we visit the vertices of T1 in inorder, then the root r, followed by the vertices of T2 in inorder.
In a postorder traversal of the vertices of T, we visit the vertices of T1 in postorder, then the vertices of T2 in postorder and finally we visit r.
Now you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.
In a preorder traversal of the vertices of T, we visit the root r followed by visiting the vertices of T1 in preorder, then the vertices of T2 in preorder.
In an inorder traversal of the vertices of T, we visit the vertices of T1 in inorder, then the root r, followed by the vertices of T2 in inorder.
In a postorder traversal of the vertices of T, we visit the vertices of T1 in postorder, then the vertices of T2 in postorder and finally we visit r.
Now you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.
9 1 2 4 7 3 5 8 9 6 4 7 2 1 8 5 9 3 6
7 4 2 8 9 5 6 3 1
#include<stdio.h> #include<iostream> using namespace std; int t1[1010],t2[1010]; void cmp(int a,int b,int n,int flag) { if(n==1)//如果存在左子树或右子树就直接输出 { printf("%d ",t1[a]); return ; } else if(n<=0)//如果不存在左子树或右子树 return ; int i;//继续罚分为左子树和右子树 for(i=0;t1[a]!=t2[b+i];i++) ;//找到 cmp(a+1,b,i,0);//左子树的遍历 cmp(a+i+1,b+i+1,n-i-1,0);//右子树的遍历 if(flag==1) printf("%d",t1[a]); else printf("%d ",t1[a]); } int main() { int n,i; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) scanf("%d",&t1[i]);//存前序 for(i=1;i<=n;i++) scanf("%d",&t2[i]);//存中序 cmp(1,1,n,1); printf("\n"); } return 0; }