數據結構實驗之二叉樹四：（先序中序）還原二叉樹

#include <bits/stdc++.h>

using namespace std;
typedef struct node
{
    int data;
    struct node *l,*r;
}*tree;
tree creat(char *a,char *b,int n)
{
    int i;
    tree root;
    if(n<=0)
    {
        return NULL;
    }
    root = new node;
    root->data = *a;
    for(i=0;i<n;i++)
    {
        if(a[0]==b[i])
        {
            break;
        }
    }
    root->l=creat(a+1,b,i);
    root->r=creat(a+i+1,b+i+1,n-i-1);
    return root;
}
void xianxu(tree root)
{
    if(root)
    {
        printf("%c",root->data);
        xianxu(root->l);
        xianxu(root->r);
    }
}
int deep(tree root)
{
    int count=0;
    if(!root)
    {
        return 0;
    }
    else
    {
        int len1=deep(root->l);
        int len2=deep(root->r);
        if(len1>=len2)
        {
            count=len1;
            count++;
        }
        else
        {
            count=len2;
            count++;
        }
    }
    return count;
}
int main()
{
    int n;
    char a[100];
    char b[100];
    while(scanf("%d",&n)!=EOF)
    {
        tree root;
        scanf("%s",a);
        scanf("%s",b);
        root=creat(a,b,n);
        printf("%d\n",deep(root));
    }
    return 0;
}