PTA_数据结构与算法题目集（中文）_7-4 是否同一棵二叉搜索树 （25 point(s)）

• 注释的坑以后填
• 链表解法

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

struct node
{
	int data;
	struct node *left;
	struct node *right;
};
typedef struct node *tp;

tp buildtree(int n);
void insertree(tp BP,tp NP);
int judtree(tp t1,tp t2);

int main()
{
	while(1)
	{
		int n,e;
		scanf("%d",&n);
		if(!n)	break;
		else	scanf("%d",&e);
		tp startP=buildtree(n);
		for(int i=0;i<e;i++)
		{	
			tp vp=buildtree(n);
			if(judtree(startP,vp))
				printf("%s\n","Yes");
			else
				printf("%s\n","No");
		}
	}
	return 0;
}
tp buildtree(int n)
{
	tp bodyT=NULL;
	for(int i=0;i<n;i++)
	{
		tp eveT=(tp)malloc(sizeof(struct node));
		scanf("%d",&eveT->data),eveT->left=NULL,eveT->right=NULL;
		if(bodyT) insertree(bodyT,eveT);
		else      bodyT=eveT;
	}
	return bodyT;
}
void insertree(tp BP,tp NP)
{
	if(NP->data<=BP->data)
	{
		if(BP->left)
			insertree(BP->left,NP);
		else
		{
			BP->left=NP;
			return;
		}
	}
	else
	{
		if(BP->right)
			insertree(BP->right,NP);
		else
		{
			BP->right=NP;
			return;
		}
	}
}
int judtree(tp t1,tp t2)
{
	if(t1==NULL&&t2==NULL)		return 1;
	if((t1!=NULL&&t2==NULL)||(t1==NULL&&t2!=NULL))	return 0;
	if(t1&&t2)
		return t1->data==t2->data?judtree(t1->left,t2->left)&judtree(t1->right,t2->right):0&&judtree(t1->left,t2->left)?t1->data==t2->data?judtree(t1->right,t2->right):0:0;
}