7-4 是否同一棵二叉搜索树 (25 分)

#include <stdio.h>
#include <stdlib.h>


typedef int ElemType;/* ElemType类型根据实际情况而定，这里假设为int */

typedef struct TreeNode *Tree;
struct TreeNode
{
    ElemType data;
    Tree left,right;
    int flag;    //被访问过为1 否则0
};

Tree NewNode(ElemType data);
Tree Insert(Tree T,ElemType data);
Tree MakeTree(int N);
int check (Tree T,ElemType data);
int Judge(Tree T,int N);
void ResetT(Tree T);
void FreeTree(Tree T);

int main()
{
    int N,L;
    Tree T;
    int i;

    scanf("%d",&N);

    while( N )
    {
        scanf("%d",&L);
        T = MakeTree( N );
        for( i=0; i<L; i++)
        {
            if( Judge(T,N))
            {
                printf("Yes\n");
            }
            else
            {
                printf("No\n");
            }
            ResetT( T );  //清除flag标记
        }
        FreeTree( T );
        scanf("%d",&N);
    }

    return 0;
}


Tree NewNode(ElemType data)
{
    //创建一个新的结点
    Tree T = (Tree) malloc(sizeof(struct TreeNode));
    T->data = data;
    T->flag = 0;
    T->left = T->right =NULL;
    return T;
}


Tree Insert(Tree T,ElemType data)
{
    //插入一个新的结点

    if( !T ){
        T = NewNode(data);
    }
    else{
    if( data > T->data)
    {
        T->right = Insert( T->right,data);
    }
    else if( data < T->data )
    {
        T->left = Insert( T->left,data);
    }

    //相等则不插入
    }

    return T;
}
Tree MakeTree(int N)
{
    Tree T;
    ElemType data;
    int i;

    scanf("%d",&data);
    T = NewNode( data );
    for( i=1; i<N; i++)
    {
        scanf("%d",&data);
        T = Insert( T,data);
    }
    return T;
}
int check (Tree T,ElemType data)
{
    if( T->flag )
    {
        if( data < T->data)
        {
            return check( T->left,data );
        }
        else if( data > T->data)
        {
            return check( T->right,data);
        }
    }
    else
    {
        if( data == T->data)
        {
            T->flag = 1;
            return 1;
        }
        else return 0;
    }
}

int Judge(Tree T,int N)
{
    //检验需验证的树是否跟已经构建的树一致
    ElemType data;
    int flag = 0;
    int i ;
    scanf("%d",&data);
    if( data != T->data)
    {
        flag = 1;  //根节点不一致
    }
    else
    {
        T->flag = 1;
    }

    for( i=1; i<N; i++)
    {
        scanf("%d",&data);
        if( (!flag) && (!check(T,data)))
        {
            flag = 1;
        }
    }
    if(flag)  return 0;
    else return 1;
}

void ResetT(Tree T)
{
    if(T->left)
    {
        ResetT(T->left);
    }
    if(T->right)
    {
        ResetT(T->right);
    }
    T->flag = 0;
}

void FreeTree(Tree T)
{
    if(T->left)
    {
        FreeTree(T->left);
    }
    if(T->right)
    {
        FreeTree(T->right);
    }
    free(T);
}