数据结构实验之查找一:二叉排序树
Time Limit: 400MS Memory limit: 65536K
题目描述
对应给定的一个序列可以唯一确定一棵二叉排序树。然而,一棵给定的二叉排序树却可以由多种不同的序列得到。例如分别按照序列{3,1,4}和{3,4,1}插入初始为空的二叉排序树,都得到一样的结果。你的任务书对于输入的各种序列,判断它们是否能生成一样的二叉排序树。
输入
输入包含若干组测试数据。每组数据的第1行给出两个正整数N (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
#include<iostream>
#include<stdio.h>
using namespace std;
struct node
{
int data;
node *l,*r;
}*head;
int n,l,c,f;
int a[100];
void Creat(node *head)
{
node *q = head;
for(int i=1; i<n; i++)
{
scanf("%d",&c);
head =q;
while(1)
{
if(head->data <c)
{
if(head->r == NULL)
{
node *p = new node;
p->data =c;
p->l = NULL, p->r = NULL;
head->r = p;
break;
}
else
head = head->r;
}
else
{
if(head->l == NULL)
{
node *p = new node;
p->data =c;
p->l = NULL, p->r = NULL;
head->l = p;
break;
}
else
head = head->l;
}
}
}
}
void judge(node *head1,node *head2)
{
if(head1&& head2)
{
if(head1->data!= head2->data)
{
f=1;
return ;
}
judge(head1->l,head2->l);
judge(head1->r,head2->r);
}
}
int main()
{
while(scanf("%d",&n)&&n!=0)
{
scanf("%d",&l);
head = new node;
head->l = NULL, head->r = NULL;
scanf("%d",&head->data);
Creat(head);
while(l--)
{
f = 0;
node *head1 = new node;
head1->l = NULL, head1->r = NULL;
scanf("%d",&head1->data);
Creat(head1);
judge(head,head1);
if(f == 0)
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}
#include<stdio.h>
using namespace std;
struct node
{
int data;
node *l,*r;
}*head;
int n,l,c,f;
int a[100];
void Creat(node *head)
{
node *q = head;
for(int i=1; i<n; i++)
{
scanf("%d",&c);
head =q;
while(1)
{
if(head->data <c)
{
if(head->r == NULL)
{
node *p = new node;
p->data =c;
p->l = NULL, p->r = NULL;
head->r = p;
break;
}
else
head = head->r;
}
else
{
if(head->l == NULL)
{
node *p = new node;
p->data =c;
p->l = NULL, p->r = NULL;
head->l = p;
break;
}
else
head = head->l;
}
}
}
}
void judge(node *head1,node *head2)
{
if(head1&& head2)
{
if(head1->data!= head2->data)
{
f=1;
return ;
}
judge(head1->l,head2->l);
judge(head1->r,head2->r);
}
}
int main()
{
while(scanf("%d",&n)&&n!=0)
{
scanf("%d",&l);
head = new node;
head->l = NULL, head->r = NULL;
scanf("%d",&head->data);
Creat(head);
while(l--)
{
f = 0;
node *head1 = new node;
head1->l = NULL, head1->r = NULL;
scanf("%d",&head1->data);
Creat(head1);
judge(head,head1);
if(f == 0)
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}