Hdu1710 (Binary Tree traversals) (binary tree traversal)

Binary Tree traversals

Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)
Total submission (s): 3475 accepted submission (s): 1555

Problem descriptiona 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.

 

Inputthe input contains several test cases. the first line of each test case contains a single integer N (1 <= n <= 1000), the number of vertices of the binary tree. followed by two lines, respectively indicating the preorder sequence and inorder sequence. you can assume they are always correspond to a exclusive binary tree.

 

Outputfor each test case print a single line specifying the corresponding postorder sequence.

 

Sample input91 2 4 7 3 5 8 9 64 7 2 1 8 5 9 3 6

 

Sample output7 4 2 8 9 5 6 3 1

 

Source HDU 2007-spring Programming Contest: given the first and middle order of a binary tree of a course, find the back order of the course number: Use the area division method to gradually narrow down the range to solve the Code:

 1 /*hdu 1710 二叉树*/ 2 //#define LOCAL 3 #include<cstdio> 4 #include<cstring> 5 using namespace std; 6 const int maxn=1005; 7 int aa[maxn],bb[maxn]; 8 void dfs(int a,int b,int n,int tag) 9 {10     int i;11     if(n<=0)return ;12     for(i=0;aa[a]!=bb[b+i];i++);13     dfs(a+1,b,i,0);14     dfs(a+i+1,b+i+1,n-i-1,0);15     printf("%d",aa[a]);16     if(!tag)printf(" ");17 }18 int main()19 {20   #ifdef LOCAL21     freopen("test.in","r",stdin);22   #endif23   int n,i,k,pre;24   while(scanf("%d",&n)!=EOF)25   {26       for(i=1;i<=n;i++)27       scanf("%d",aa+i);28     for(i=1;i<=n;i++)29       scanf("%d",bb+i);30     dfs(1,1,n,1);31     printf("\n");32   }33  return 0;34 }

View code

 

Hdu1710 (Binary Tree traversals) (binary tree traversal)