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

#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);	}}int getBiggestValue(BiTree T){	if(NULL == T)		return 0;	int maxLeft = getBiggestValue(T->leftChild);	int maxRight = getBiggestValue(T->rightChild);	int max = maxLeft > maxRight ? maxLeft : maxRight;	return max > T->data ? max : T->data;}int main(){	BiTree T1;	T1 = createBiTree1();	cout << getBiggestValue(T1) << endl;	BiTree T2;	createBiTree2(T2);	cout << getBiggestValue(T2) << endl;	return 0;}
   

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