Tree Recovery UVA - 536

     

 ACA代码（裸地二叉树遍历给出前中序推后序）

Select Code

#include<stdio.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
using namespace std;
struct node
{
    char data;
    struct node *l ,*r;
};
char a[30], b[30];
struct node*ans(int n, char *a, char *b)
{
    int i;
    struct node *root;
    if(n==0)
    return NULL;
    root = new node;
    root->data = a[0];
    for( i = 0;i<n;i++)
    {
        if(b[i]==a[0])
            break;
    }
    root->l = ans(i, a+1, b);
    root->r = ans(n-1-i, a+1+i, b+i+1);
    return root;
}
void hou(struct node *root)
{
    if(root)
    {
        hou(root->l);
        hou(root->r);
        printf("%c",root->data);
    }
}
int main()
{

    while(scanf("%s %s",a, b)!=EOF)
    {
        struct node *root;
        int len = strlen(a);
        root = ans(len, a, b);
        hou(root);
        printf("\n");
    }
    return 0;
}