6.36相似树.cpp

严蔚敏 数据结构题集 第六章 答案 自己做的

#include<iostream.h>
typedef char ElemType;
#include"BTree.h"
int BT_alike(BTreeNode *BT1,BTreeNode *BT2)
{
	if(BT1==NULL&&BT2==NULL)
		return 1;
	else if(BT1&&BT2&&BT_alike(BT1->left,BT2->left)&&BT_alike(BT1->right,BT2->right))
		return 1;
	else return 0;
}
void main()
{
	BTreeNode *BT1,*BT2;
	InitBTree(BT1);
	InitBTree(BT2);
	char *a,*b;
	a=new char[30];
	b=new char[30];
	int i=0,k;
	cout<<"输入二叉树BT1以@结束:"<<endl;
	cin>>*a;
	while(*(a+i)!='@')
	{
		i++;
		cin>>*(a+i);
	}
	CreateBTree(BT1,a);
	 i=0;
	cout<<"输入二叉树BT2以@结束:"<<endl;
	cin>>*b;
	while(*(b+i)!='@')
	{
		i++;
		cin>>*(b+i);
	}
	CreateBTree(BT2,b);
	k=BT_alike(BT1,BT2);
	if(k==1)
		cout<<"相似"<<endl;
	else cout<<"不相似"<<endl;
}