2804=数据结构实验之二叉树八：（中序后序）求二叉树的深度

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node
{
    char a;
    struct node*left,*right;
};
int max(int a,int b)
{
    if(a>b)return a;
    else return b;
}
struct node *creat(int n,char s1[],char s2[] )
{
    if(n==0)return NULL;
    struct node *root;
    root=(struct node*)malloc(sizeof(struct node));
    int i;
    for(i=0;i<n;i++)
    {
        if(s1[i]==s2[n-1])break;
    }
    root->left = creat(i,s1,s2);
    root->right = creat(n-i-1,s1+i+1,s2+i);
    return root;
};
int deep(struct node*root)
{
    int h;
    int d1,d2;
    if(root)
    {
        d1=deep(root->left);
        d2=deep(root->right);
        h=max(d1+1,d2+1);
    }
    return h;
}
int main()
{
    struct node*root;
    char s2[1000],s1[1000];
    int n,len;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s%s",s1,s2);
        len=strlen(s1);
        root=(struct node*)malloc(sizeof(struct node));
        root=creat(len,s1,s2);
        printf("%d\n",deep(root));
    }
    return 0;
}