本文共 1386 字，大约阅读时间需要 4 分钟。

#include
   
    #define N 63using namespace std;char str[] = "ab#d##a#e##";int i = -1;typedef struct node{	struct node *leftChild;	struct node *rightChild;	char data;}BiTreeNode, *BiTree;//生成一个结点BiTreeNode *createNode(int i){	BiTreeNode * q = new BiTreeNode;	q->leftChild = NULL;	q->rightChild = NULL;	q->data = i;	return q;}BiTree createBiTree1(){	BiTreeNode *p[N] = {NULL};	int i;	for(i = 0; i < N; i++)		p[i] = createNode(i + 1);	// 把结点连接成树	for(i = 0; i < N/2; i++)	{		p[i]->leftChild = p[i * 2 + 1];		p[i]->rightChild = p[i * 2 + 2];	}	return p[0];}void createBiTree2(BiTree &T){	i++;	char c;	if(str[i] && '#' == (c = str[i]))		T = NULL;	else	{		T = new BiTreeNode;		T->data = c;		createBiTree2(T->leftChild);		createBiTree2(T->rightChild);	}}bool areBiTreeEqual(BiTree T1, BiTree T2){	if(NULL == T1 && NULL == T2)		return true;	if(NULL == T1 || NULL == T2)		return false;	if(T1->data != T2->data)		return false;	if(areBiTreeEqual(T1->leftChild, T2->leftChild) && areBiTreeEqual(T1->rightChild, T2->rightChild))		return true;	return false;}void print(bool b){	if(b)		cout << "equal" << endl;	else		cout << "not equal" << endl;}int main(){	BiTree T1 = NULL;	BiTree T2 = NULL;	print(areBiTreeEqual(T1, T2));	T1 = createBiTree1();	print(areBiTreeEqual(T1, T2));		createBiTree2(T2);	print(areBiTreeEqual(T1, T2));	print(areBiTreeEqual(T1, T1));	print(areBiTreeEqual(T2, T2));	return 0;}
   

转载地址：http://mdzti.baihongyu.com/