输入格式:
数据有多组。每组数据第1行是一个数n(1<=n<=20)表示有n个需要判断,n=0的时候输入结束。接下去一行是一个序列,序列长度小于10,没有重复数字,根据这个序列可以构造出一棵二叉排序树。接下去的n行有n个序列,分别可构造一棵二叉排序树。判断这两棵二叉排序树是否相同。
输出格式:
相同输出YES,不相同输出NO
样例输入
2
567432
543267
576342
0
样例输出
YES
NO
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAXSIZE 10
#define ElemType char
typedef struct node {
ElemType data;
struct node *lchild, *rchild;
}BiNode, *BiTree;
int InSert (BiTree *T, ElemType key);
BiTree CreatBiTree (ElemType *p, int n);
int Judge (BiTree T1, BiTree T2);
void InOrderTraverse (BiTree T);
int main (void) {
int n, i, j, len, len1, flag = 0, t;
ElemType num[MAXSIZE];
ElemType num1[MAXSIZE];
int index[21];
BiTree T1 = NULL, T2 = NULL;
while (~scanf ("%d", &n) && n) {
t = n;
scanf ("%s", num);
len = strlen(num);
//flag = 0;
//printf ("%d",len);
T1 = CreatBiTree (num, len);
//InOrderTraverse (T1);
while (n--) {
scanf ("%s", num1);
len1 = strlen (num1);
T2= CreatBiTree (num1, len1);
//InOrderTraverse (T2);
//index[flag] = Judge (T1, T2);
//printf ("%d", Judge (T1, T2));
//flag++;
flag = Judge (T1, T2);
if (flag == 1) printf ("YES\n");
else printf ("NO\n");
}
}
/*for (i = 0; i < t; i++) {
if (index[i] == 1) {
printf ("YES\n");
}
else {
printf ("NO\n");
}
//printf ("%d", index[i]);
}*/
/*for (j = 0; j < len + 1; j++) {
printf ("%d ",num[j]);
}*/
return 0;
}
int InSert (BiTree *T, ElemType key) {
if ((*T) == NULL) {
(*T) = (BiTree)malloc(sizeof(BiNode));
(*T)->data = key;
(*T)->lchild = NULL;
(*T)->rchild = NULL;
return 1;
}
else if ((*T)->data == key) return 0;
else if (key < (*T)->data) return InSert (&(*T)->lchild, key);
else return InSert (&(*T)->rchild, key);
}
BiTree CreatBiTree (ElemType *p, int n) {
BiTree T = NULL;
int i = 0;
while (i < n) {
InSert (&T,*(p+i));
i++;
}
return T;
}
int Judge (BiTree T1, BiTree T2) {
if (T1 == NULL && T2 == NULL) return 1;
else if (T1 == NULL && T2) return 0;
else if (T1 && T2 == NULL) return 0;
else if (T1->data != T2->data) return 0;
else return (Judge (T1->lchild, T2->lchild) && Judge (T1->rchild, T2->rchild) || Judge (T1->lchild,T2->rchild) && Judge (T1->rchild, T2->lchild));
}
void InOrderTraverse (BiTree T) {
if (T) {
InOrderTraverse (T->lchild);
printf ("%c ",T->data);
InOrderTraverse (T->rchild);
}
}
两种输出方式,注释掉的是在所有数据输入完成后输出结果的方式,没有注释掉的是随着一行输入,输出结果的方式。
思路还是比较简单的,值得注意的一个点是判断函数中的else return (Judge (T1->lchild, T2->lchild) && Judge (T1->rchild, T2->rchild) || Judge (T1->lchild,T2->rchild) && Judge (T1->rchild, T2->lchild));
这里,||之后的情况不要忘记。
还有一种思路是建好二叉排序树,通过其先序遍历结果和中序遍历结果来判断是否相同。仅靠中序遍历是不可以的。