九度oj 题目1078：二叉树遍历

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include <string>
 5 using namespace std;
 6 
 7 typedef struct Node{
 8   char data;
 9   struct Node *lchild;
10   struct Node *rchild;
11 }BTree;
12 
13 string str1, str2;
14 void postOrder(BTree *T)
15 {
16  if(T!=NULL)
17  {if(T->lchild!=NULL) 
18     postOrder(T->lchild);
19   if(T->rchild!=NULL)
20      postOrder(T->rchild);
21   cout<<T->data;
22  }
23  return;
24 }
25 
26 BTree *trans(int l1,int h1,int l2,int h2){ 
27       if(l1 > h1 || l2 > h2)//递归出口，不符合条件，直接返回空节点 
28             return NULL;
29     int j = l2;
30     
31     while(str2[j] != str1[l1]){ j++; }
32     
33     //构造根节点 
34     BTree *T=(BTree*)malloc(sizeof(BTree));  
35     T->data=str2[j];   
36     T->lchild=NULL;   
37     T->rchild=NULL;
38     
39     T->lchild=trans(l1+1,l1+j-l2,l2,j-1); //返回左子树 
40     T->rchild=trans(l1+j-l2+1,h1,j+1,h2); //返回右子树 
41     return T;
42 }
43 
44 
45 int main()
46 {
47        
48     while(cin >> str1 >> str2)
49     {
50       int L1 = str1.length();
51       int L2 = str2.length();
52       BTree *T = trans(0,L1-1,0,L2-1);
53       postOrder(T);
54       cout << endl;
55     }
56   return 0;
57 }

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 typedef struct Node{
 8   char data;
 9   struct Node *lchild;
10   struct Node *rchild;
11 }BTree;
12 
13 char str1[30], str2[30];
14 
15 void postOrder(BTree *T){
16      if(T != NULL){
17         if(T->lchild != NULL) 
18             postOrder(T->lchild);
19           if(T->rchild != NULL)
20              postOrder(T->rchild);
21           printf("%c", T->data);
22      }
23      return;
24 }
25 
26 BTree *trans(int l1,int h1,int l2,int h2){ 
27     if(l1 > h1 || l2 > h2)//递归出口，不符合条件，直接返回空节点 
28             return NULL;
29     int j = l2;
30     
31     while(str2[j] != str1[l1]){ j++; }
32     
33     //构造根节点 
34     BTree *T = (BTree*)malloc(sizeof(BTree));  
35     T->data = str2[j];   
36     T->lchild = NULL;   
37     T->rchild = NULL;
38     
39     T->lchild = trans(l1+1, l1+j-l2, l2, j-1); //返回左子树 
40     T->rchild = trans(l1+j-l2+1, h1, j+1, h2); //返回右子树 
41     return T;
42 }
43 
44 
45 int main()
46 {
47        int L1, L2;
48     while(scanf("%s %s", str1, str2) != EOF){
49       L1 = strlen(str1);
50       L2 = strlen(str2);
51       BTree *T = trans(0,L1-1,0,L2-1);
52       postOrder(T);
53       printf("\n");
54     }
55   return 0;
56 }