二叉树操作(1) 建立与递归遍历

本文主要介绍二叉树的基本操作——先序建立、先序递归遍历、中序递归遍历、层次递归遍历

代码如下：

#include<cstdio>
#include<cstring>
#include<iostream>
#define MAX 100
using namespace std;

typedef struct BiTNode
{
	char data;
	struct BiTNode *lchild;
	struct BiTNode *rchild;
}BiTNode, *BiTree;

typedef struct BiTreeStack
{
	BiTree data[MAX];
	int top;
}Sepstack;

int xxCreateBiTree(BiTree &T)                      //先序建立二叉树
{
	char ch;
	scanf_s("%c", &ch);
	getchar();
	if (ch == '#')
		T = NULL;
	else
	{
		T = (BiTNode*)malloc(sizeof(BiTNode));
		T->data = ch;
		xxCreateBiTree(T->lchild);
		xxCreateBiTree(T->rchild);
	}
	return 1;
}

int xxblBiTree(BiTree &T)                    //先序递归遍历
{
	if (T)
	{
		printf("%c ", T->data);
		xxblBiTree(T->lchild);
		xxblBiTree(T->rchild);
	}
	return 1;
}

int zxblBiTree(BiTree &T)                    //中序递归遍历
{
	if (T)
	{
		zxblBiTree(T->lchild);
		printf("%c ", T->data);
		zxblBiTree(T->rchild);
	}
	return 1;
}

int hxblBiTree(BiTree &T)                    //后序递归遍历
{
	if (T)
	{
		hxblBiTree(T->lchild);
		hxblBiTree(T->rchild);
		printf("%c ", T->data);
	}
	return 1;
}

int ccblBiTree(BiTree &T)                    //基于循环队列的层次遍历
{
	if (T == NULL)
		return 0;
	BiTree Q[MAX], p;
	int f , r;
	f = r = 0;
	Q[r] = T;
	r = (r + 1) % MAX;
	while (f != r)
	{
		p = Q[f];
		printf("%c ", p->data);
		f = (f + 1) % MAX;
		if (p->lchild)
		{
			Q[r] = p->lchild;
			r = (r + 1) % MAX;
		}
		if (p->rchild)
		{
			Q[r] = p->rchild;
			r = (r + 1) % MAX;
		}
	}
	return 1;
}

int main()
{
	BiTree T;
	xxCreateBiTree(T);
	xxblBiTree(T);
	printf("\n");
	zxblBiTree(T);
	printf("\n");
	hxblBiTree(T);
	printf("\n");
	ccblBiTree(T);
	printf("\n");
	system("pause");
}

编译环境：Visual Studio