두 갈래 나무의'뚱뚱'도를 구하다

살이 좀 쪄서 늘 다이어트를 재촉받는다.다음은 두 갈래 나무가 얼마나 뚱뚱한지 살펴보자. 프로그램은 다음과 같다.

#include<iostream>
#define N 63

using namespace std;

char str[] = "ab#d##c#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 max(int x, int y)
{
	return x > y ? x : y;
}

int getDepth(BiTree T)
{
	if(NULL == T)
		return 0;

	return 1 + max(getDepth(T->leftChild), getDepth(T->rightChild));
}

int getNodeAtLevel(BiTree T, int level)
{
	//          ：if(NULL == T)，       
	if(NULL == T || level < 1 || level > getDepth(T))
		return 0;

	if(1 == level)
		return 1;

	return getNodeAtLevel(T->leftChild, level - 1) + getNodeAtLevel(T->rightChild, level - 1);
}

int getBreadth(BiTree T)
{
	if(NULL == T)
		return 0;

	int breadth = getNodeAtLevel(T, 1);
	int depth = getDepth(T);
	
	int i;
	for(i = 1; i <= depth; i++)
	{
		if(breadth < getNodeAtLevel(T, i))
		{
			breadth = getNodeAtLevel(T, i);
		}
	}

	return breadth;
}

int main()
{
	BiTree T1;
	T1 = createBiTree1();
	cout << getBreadth(T1) << endl;

	BiTree T2;
	createBiTree2(T2);
	cout << getBreadth(T2) << endl;
	
	return 0;
}