上から下へ入力して木の子供の兄弟のチェーンを創立して構造(例えば、芫A、AB、AC、BD、菗儏菗)を記憶しにきて、木の深さを求めます.要求:一つのプログラムで完成します.

#include 
#include 
//         
#define TRUE		1
#define FALSE		0
#define OK			1
#define ERROR		0
#define	INFEASIBLE	-1
#define OVERFLOW	-2
typedef int Status;

typedef char TElemType;		//       
#define MAX_TREE_SIZE 100	//          
typedef TElemType  SqBiTree[MAX_TREE_SIZE];	// 0        
SqBiTree  bt;

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define MAXLEN 100

//          
typedef struct CSNode	//    
{
	TElemType Data;
	struct CSNode *firstchild, *nextsibling;
}CSNode, *CSTree;

//         
typedef struct QNode
{
	CSTree Data;
	struct QNode *next;
}QNode, *QueuePtr;

typedef struct
{
	QueuePtr front;
	QueuePtr rear;
}LinkQueue;

//     
Status InitQueue(LinkQueue &Q)
{
	Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
	if (!Q.front)
		exit(OVERFLOW);
	Q.front->next = NULL;
	return OK;
}

//    
Status DestoryQueue(LinkQueue &Q)
{
	while (Q.front)
	{
		Q.rear = Q.front->next;
		free(Q.front);
		Q.front = Q.rear;
	}
	return OK;
}

//  
Status EnQueue(LinkQueue &Q, CSTree e)
{
	QueuePtr p;
	p = (QueuePtr)malloc(sizeof(QNode));
	if (!p)
		exit(OVERFLOW);
	p->Data = e;
	p->next = NULL;
	Q.rear->next = p;
	Q.rear = p;
	return OK;
}

//  
Status DeQueue(LinkQueue &Q, CSTree &e)
{
	QueuePtr p;
	if (Q.front == Q.rear)
		return ERROR;
	p = Q.front->next;
	e = p->Data;
	Q.front->next = p->next;
	if (Q.rear == p)
		Q.rear = Q.front;
	free(p);
	return OK;
}

//   
Status GetHead(LinkQueue &Q, CSTree &e)
{
	QueuePtr p;
	if (Q.front == Q.rear)
		return ERROR;
	p = Q.front->next;
	e = p->Data;
	return OK;
}

//      ——      
CSTree GetTreeNode(TElemType e)
{
	CSTree p;
	p = (CSTree)malloc(sizeof(CSNode));
	if (!p)
		exit(OVERFLOW);
	p->Data = e;
	p->firstchild = NULL;
	p->nextsibling = NULL;
	return p;
}

//      ——    
Status CreateTree(CSTree &T)
{
	char first = ' ', second = ' ';
	int result = 0;
	LinkQueue Q;
	CSTree p, s, r;
	InitQueue(Q);
	T = NULL;
	for (scanf("%c%c", &first, &second);
		second != '#'; result = scanf("%c%c", &first, &second))
	{
		p = GetTreeNode(second);
		EnQueue(Q, p);
		if (first == '#')
			T = p;
		else
		{
			GetHead(Q, s);
			while (s->Data != first)
			{
				DeQueue(Q, s);
				GetHead(Q, s);
			}
			if (!(s->firstchild))
			{
				s->firstchild = p;
				r = p;
			}
			else
			{
				r->nextsibling = p;
				r = p;
			}
		}
	}
	return OK;
}

//     
int TreeDepth(CSTree T)
{
	int h1, h2;
	if (!T)
		return 0;
	else
	{
		h1 = TreeDepth(T->firstchild);
		h2 = TreeDepth(T->nextsibling);
		return(((h1 + 1) > h2) ? (h1 + 1) : h2);
	}
}

int main(int argc, char const *argv[])
{
	CSTree T;

	printf("
 
");
	printf("               （  #AABACADCECFEG##):
");
	CreateTree(T);

	printf("     ：%d
", TreeDepth(T));
	system("pause");
	return 0;
}