判断两棵二叉树是否相等

判断两棵二叉树是否相等

Description

首先利用二叉树的前序遍历建立2棵二叉树，然后利用前序遍历判断2棵二叉树是否相等，代码可以参考教材P20页程序5.11， 但可以稍加修改，可以不写运算符重载 operator==函数，就写一个equal函数，而且直接把equal函数定义为二叉树类的一个成员函数（不用是友元函数）

Input

输入有2行，分别对应2棵二叉树

Output

输出只有一行，2棵二叉树相等输出 “equal” ， 不相等输出 "not equal”

Sample Input

ABD##EG###C#F##
ABD##EG###C#F##

Sample Output

equal

代码如下:

#include<iostream>

using namespace std;

template<class T>
struct TreeNode
{
	T data;
	TreeNode<T>* leftchild;
	TreeNode<T>* rightchild;
	TreeNode()
	{
		leftchild = NULL;
		rightchild = NULL;
	}
	TreeNode(T x)
	{
		data = x;
		leftchild = NULL;
		rightchild = NULL;
	}
};

template<class T>
class Tree
{
public:
	Tree();
	~Tree();
	void CreateTree(TreeNode<T>*& t);
	void deleTree(TreeNode<T>* t);
	void output(TreeNode<T>* t,char s[],int& n);
	TreeNode<T>* root;
};

template<class T>
Tree<T>::Tree()
{
	root = NULL;
}

template<class T>
Tree<T>::~Tree()
{

}

template<class T>
void Tree<T>::CreateTree(TreeNode<T>*& t)
{
	T x;
	cin >> x;
	if (x == '#')
	{
		t = NULL;
		return;
	}
	t = new TreeNode<T>(x);
	if (t == NULL)
		return;
	CreateTree(t->leftchild);
	CreateTree(t->rightchild);
}

template<class T>
void Tree<T>::deleTree(TreeNode<T>* t)
{
	if (t == NULL)
		return;
	deleTree(t->leftchild);
	deleTree(t->rightchild);
	delete t;
}
template<class T>
void Tree<T>::output(TreeNode<T>* t, char s[],int& n)
{
	if (t != NULL)
	{
		output(t->leftchild, s, n);
		s[n++] = t->data;
		output(t->rightchild, s, n);
	}
}
template<class T> 
bool judge(Tree<T>& t1, Tree<T>& t2)
{
	T s1[100] = { 0 }, s2[100] = { 0 };
	int n1 = 0, n2 = 0;
	t1.output(t1.root, s1, n1);
	t2.output(t2.root, s2, n2);
	if (n1 != n2)
		return false;
	else
	{
		for (int i = 0; i < n1; i++)
		{
			if (s1[i] != s2[i])
				return false;
		}
		return true;
	}
}

int main()
{
	Tree<char> t1,t2;
	t1.CreateTree(t1.root);
	t2.CreateTree(t2.root);
	if (judge(t1, t2))
		cout << "equal" << endl;
	else
		cout << "not equal" << endl;
	t1.deleTree(t1.root);
	t2.deleTree(t2.root);
	return 0;
}