04-树4 是否同一棵二叉搜索树

日常，服了，一遍遍检查，‘NO’ or 'No'，让我检查好久，甚至重新对着小白专场，抄了一遍<v^V>

给定一个插入序列就可以唯一确定一棵二叉搜索树。然而，一棵给定的二叉搜索树却可以由多种不同的插入序列得到。例如分别按照序列{2, 1, 3}和{2, 3, 1}插入初始为空的二叉搜索树，都得到一样的结果。于是对于输入的各种插入序列，你需要判断它们是否能生成一样的二叉搜索树。

输入格式:

输入包含若干组测试数据。每组数据的第1行给出两个正整数N (≤10)和L，分别是每个序列插入元素的个数和需要检查的序列个数。第2行给出N个以空格分隔的正整数，作为初始插入序列。随后L行，每行给出N个插入的元素，属于L个需要检查的序列。

简单起见，我们保证每个插入序列都是1到N的一个排列。当读到N为0时，标志输入结束，这组数据不要处理。

输出格式:

对每一组需要检查的序列，如果其生成的二叉搜索树跟对应的初始序列生成的一样，输出“Yes”，否则输出“No”。

输入样例:

4 2
3 1 4 2
3 4 1 2
3 2 4 1
2 1
2 1
1 2
0

输出样例:

Yes
No
No

我的AC: 

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

typedef struct TNode* BT;
struct TNode{
	int data;
	bool flag;
	BT Left, Right;
};

BT Make_Sample_Tree(int num);
BT Add_value(int data, BT T);
BT Init_Tree(int data);
bool Judge_Tree(int Length, BT T);
bool Check_Tree(int data, BT T);
void Recompose_Tree(BT T);
void Free_Tree(BT T);

int main()
{
	int Length, num;
	BT Tree;
	while((scanf("%d", &Length)) == 1 && Length != 0){
		scanf("%d", &num);
		Tree = Make_Sample_Tree(Length);
		while(num --){
			if(Judge_Tree(Length, Tree)){
				printf("Yes\n");
			}else{
				printf("No\n");
			}
			Recompose_Tree(Tree);
		}
		Free_Tree(Tree);
	}
	return 0;
}
BT Make_Sample_Tree(int num)
{
	int data;
	BT Tree;
	scanf("%d", &data);
	Tree = Init_Tree(data);
	for(int i = 1; i< num; i++){
		scanf("%d", &data);
		Add_value(data, Tree);
	}
	return Tree;
}
BT Add_value(int data, BT T)
{
	if(!T){
		T = Init_Tree(data);
	}else{
		if(data > T ->data){
			T ->Right = Add_value(data, T ->Right);
		}else{
			T ->Left = Add_value(data, T ->Left);
		}
	}
	return T;
}
BT Init_Tree(int data)
{
	BT T;
	T = (BT)malloc(sizeof(struct TNode));
	T ->data = data;
	T ->Left = NULL;
	T ->Right = NULL;
	T ->flag = false;
	return T;
}
bool Judge_Tree(int Length, BT T)
{
	int num;
	bool flag = true;
	while(Length--){
		scanf("%d", &num);
		if(flag && !(Check_Tree(num, T))){
			flag = false;
		}
	}
	return flag;
}
bool Check_Tree(int data, BT T)
{
	if(T ->flag){
		if(data > (T ->data)){
			return Check_Tree(data, T ->Right);
		}else if(data < (T ->data)){
			return Check_Tree(data, T ->Left);
		}else{
			return false;
		}
	}else{
		if(data == (T ->data)){
			T ->flag = true;
			return true;
		}else{
			return false;
		}
	}
}
void Recompose_Tree(BT T)
{
	if(T ->Left)
		Recompose_Tree(T ->Left);
	if(T ->Right)
		Recompose_Tree(T ->Right);
	T ->flag = false;
}
void Free_Tree(BT T)
{
	if(T ->Left)
		Free_Tree(T->Left);
	if(T ->Right)
		Free_Tree(T->Right);
	free(T);
}

 复查的时候产生

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

typedef struct TNode* BT;
struct TNode{
	int data;
	int flag;
	BT Left, Right;
};

BT Make_Sample_Tree(int num);
BT Add_value(int data, BT T);
BT Init_Tree(int data);
int Judge_Tree(int Length, BT T);
int Check_Tree(int data, BT T);
void Recompose_Tree(BT T);
void Free_Tree(BT T);

int main()
{
	int Length, num;
	BT Tree;
	while((scanf("%d", &Length)) == 1 && Length != 0){
		scanf("%d", &num);
		Tree = Make_Sample_Tree(Length);
		for(int i = 0; i < num; i++){
			if(Judge_Tree(Length, Tree)){
				printf("Yes\n");
			}else{
				printf("No\n");
			}
			Recompose_Tree(Tree);
		}
		Free_Tree(Tree);
	}
	return 0;
}
BT Make_Sample_Tree(int num)
{
	int data, i;
	BT Tree;
	scanf("%d", &data);
	Tree = Init_Tree(data);
	for(i = 1; i < num; i++){
		scanf("%d", &data);
		Tree = Add_value(data, Tree);
	}
	return Tree;
}
BT Add_value(int data, BT T)
{
	if(!T){
		T = Init_Tree(data);
	}else{
		if(data > T ->data){
			T ->Right = Add_value(data, T ->Right);
		}else{
			T ->Left = Add_value(data, T ->Left);
		}
	}
	return T;
}
BT Init_Tree(int data)
{
	BT T;
	T = (BT)malloc(sizeof(struct TNode));
	T ->data = data;
	T ->Left = NULL;
	T ->Right = NULL;
	T ->flag = 0;
	return T;
}
int Judge_Tree(int Length, BT T)
{
	int num, i;
	int flag = 0;
	scanf("%d", &num);
	if(num != T->data){
		flag = 1;
	}else{
		T ->flag = 1;
	}
	for(int i = 1; i < Length; i++){
		scanf("%d", &num);
		if((!flag) && (!Check_Tree(num, T))){
			flag = 1;
		}
	}
	if(flag){
		return 0;
	}else{
		return 1;
	}
}
int Check_Tree(int data, BT T)
{
	if(T ->flag){
		if(data > (T ->data)){
			return Check_Tree(data, T ->Right);
		}else if(data < (T ->data)){
			return Check_Tree(data, T ->Left);
		}else{
			return 0;
		}
	}else{
		if(data == (T ->data)){
			T ->flag = 1;
			return 1;
		}else{
			return 0;
		}
	}
}
void Recompose_Tree(BT T)
{
	if(T){
        T->flag=0;
        Recompose_Tree(T->Left);
        Recompose_Tree(T->Right);
    }
}
void Free_Tree(BT T)
{
	if(T){
		Free_Tree(T->Left);
		Free_Tree(T->Right);
		free(T);
	}
}