3373=数据结构实验之查找一：二叉排序树

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node
{
    int data;
    struct node *left,*right;
};
struct node * new()
{
    struct node *root;
    root=(struct node*)malloc(sizeof(struct node));
    root->left=NULL;
    root->right=NULL;
    return root;
};
struct node * built(struct node* root,int t)
{
    if(root==NULL)
    {
        root=new();
        root->data=t;
        return root;
    }
    if(t>root->data)
    {
        root->right=built(root->right,t);
        return root;
    }
    if(t<root->data)
    {
        root->left=built(root->left,t);
        return root;
    }
}
int judge(struct node*root1,struct node*root2)
{
    if(root1==NULL&&root2==NULL)return 1;
    if(root1!=NULL&&root2!=NULL)
    {
        if(root1->data==root2->data&&judge(root1->left,root2->left)==1&&judge(root1->right,root2->right))
        {
            return 1;
        }
        else return 0;
    }
    else return 0;
}
int main()
{
    int n,m,i,t;
    while(~scanf("%d",&n))
    {
        if(n==0)break;
        scanf("%d",&m);
        struct node *root1;
        root1=NULL;
        for(i=0; i<n; i++)
        {
            scanf("%d",&t);
            root1=built(root1,t);
        }
        while(m--)
        {
            struct node *root2;
            root2=NULL;
            for(i=0; i<n; i++)
            {
                scanf("%d",&t);
                root2=built(root2,t);
            }
            if(judge(root1,root2)==1)printf("Yes
");
            else printf("No
");
        }
    }
    return 0;
}