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

解题代码

#include<stdio.h>
#include<stdlib.h>
typedef struct TNode* BinTree;
struct TNode {
	int data;
	BinTree Left, Right;
	int flag;
};
int Judge(BinTree BST, int X);
void Eflag(BinTree BST);
BinTree Insert(BinTree BST, int X);
void FreeTree(BinTree BST);
int main()
{

	int N, L, i, flag, temp;
	BinTree BST = NULL;
	scanf("%d", &N);
	while (N) {
		scanf("%d", &L);
		for (i = 0; i < N; i++) {
			scanf("%d", &temp);
			BST = Insert(BST, temp);
		}
		while (L--) {
			flag = 1;
			for (i = 0; i < N; i++) {
				scanf("%d", &temp);
				if (flag&&!Judge(BST, temp)) flag = 0;
			}
			if (flag) printf("Yes\n");
			else printf("No\n");
			Eflag(BST);
		}
		FreeTree(BST);
		BST = NULL;
		scanf("%d", &N);
	}
	return 0;
}
int Judge(BinTree BST, int X) {
	if (!BST->flag) {
		if (X == BST->data) {
			BST->flag = 1;
			return 1;
		}
		else return 0;
	}
	else {
		if (X < BST->data) return Judge(BST->Left, X);
		else if (X > BST->data) return Judge(BST->Right, X);
		else return 0;
	}
}
void Eflag(BinTree BST) {
	if (BST->Left) Eflag(BST->Left);
	if (BST->Right) Eflag(BST->Right);
	BST->flag = 0;
}
BinTree Insert(BinTree BST, int X) {
	if (!BST) {
		BST = malloc(sizeof(struct TNode));
		BST->flag = 0;
		BST->data = X;
		BST->Left = BST->Right = NULL;
	}
	else {
		if (X < BST->data) BST->Left = Insert(BST->Left, X);
		else if (X > BST->data) BST->Right = Insert(BST->Right, X);
	}
	return BST;
}
void FreeTree(BinTree BST) {
	if (BST->Left) FreeTree(BST->Left);
	if (BST->Right) FreeTree(BST->Right);
	free(BST);
}

测试结果

问题整理

1。个人建议不要分的太多的子函数，比如newtree和insert完全可以写到一起。
2.但是这题确实应该把建树或检测的过程单独拎出来，懒惰了。。。
3.后果就是忘记更新BST=NULL导致改了半天。