C语言-二叉树的建立以及前，中，后序遍历

代码

#define MAXSIZE 100
#include<stdlib.h>
#include<stdio.h>

typedef struct Node
{
	char data;
	struct Node* Lchild;
	struct Node* Rchild;
}BiTNode, *Bitree;

typedef struct stack
{
	Bitree data[MAXSIZE];
	int top;
}Seqstack;

// 初始化栈
Seqstack* InitStack()
{
	Seqstack *s;
	s = (Seqstack *)malloc(sizeof(Seqstack));
	s->top = -1;
	return s;
}


//判断栈是否为空
int IsEmpty(Seqstack *s)
{
	if (s->top == -1)
		return 1;
	else
		return 0;
}


//入栈
int Push(Seqstack *s, Bitree root)
{
	if (s->top == MAXSIZE - 1)
		return 0;
	else
	{
		s->top++;
		s->data[s->top] = root;
		return 1;
	}
}

//出栈
int Pop(Seqstack *s, Bitree *root)
{
	if (IsEmpty(s))
		return 0;
	else
	{
		*root = s->data[s->top];
		s->top--;
	}
	return 1;
}

//获取栈顶元素
int Top(Seqstack*s, Bitree *root)
{
	if (IsEmpty(s))
		return 0;
	else
	{
		*root = s->data[s->top];
	}
	return 1;
}

void creatFirst(Bitree *T)
{
	char ch;
	ch = getchar();
	if (ch == '#')
		*T = NULL;
	else
	{
		*T = (Bitree)malloc(sizeof(BiTNode));
		(*T)->data = ch;
		creatFirst(&((*T)->Lchild));
		creatFirst(&((*T)->Rchild));
	}
}

//先序
void PreOrder(Bitree root)
{
	if (root)
	{
		printf("%c", root->data);
		PreOrder(root->Lchild);
		PreOrder(root->Rchild);
	}
}

//中序
void InOrder(Bitree root)
{
	if (root)
	{
		InOrder(root->Lchild);
		printf("%c", root->data);
		InOrder(root->Rchild);
	}
}

//后序
void PostOrder(Bitree root)
{
	Seqstack *s;
	Bitree p, q;
	s = InitStack();
	p = root;
	q = NULL;
	while (p != NULL || !IsEmpty(s))
	{
		while (p != NULL)
		{
			Push(s, p);
			p = p->Lchild;
		}
		if (!IsEmpty(s))
		{
			Top(s, &p);
			if ((p->Rchild == NULL) || (p->Rchild == q))
			{
				Pop(s, &p);
				printf("%c", p->data);
				q = p;
				p = NULL;
			}
			else
				p = p->Rchild;
		}
	}
}

int main()
{
	Bitree root;
	creatFirst(&root);
	PreOrder(root);
	printf("\n");
	InOrder(root);
	printf("\n");
	PostOrder(root);
	system("pause");
	return 0;
}

测试