二叉树的层次遍历

简单的实现了二叉树的层次遍历，用了图的广度优先搜索思想，具体实现如下：

例子如下图：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MaxSize 100
typedef struct node
{
	int data;
	struct node *lchild, *rchild;
}BinTree,*BinNode;
BinNode AddNewNode(int data)
{
	BinNode NewNode = (BinNode)malloc(sizeof(BinTree));
	memset(NewNode, 0, sizeof(BinTree));
	NewNode->data = data;
	return NewNode;
}
void PreOrder(BinNode root)
{
	if (root != NULL)
	{
		printf("%d ", root->data);
		PreOrder(root->lchild);
		PreOrder(root->rchild);
	}
}
void bfs(BinNode root)
{
	BinNode Queue[MaxSize];
	int rear = 0, front = 0;
	Queue[rear++] = root;
	while (front != rear)
	{
		BinNode v = Queue[front++];
		printf("%d ", v->data);
		if (v->lchild != NULL)
			Queue[rear++] = v->lchild;
		if (v->rchild != NULL)
			Queue[rear++] = v->rchild;
	}
}
int main()
{
	BinNode root = AddNewNode(1);
	root->lchild = AddNewNode(2);
	root->rchild = AddNewNode(4);
	root->lchild->lchild = AddNewNode(3);
	root->lchild->lchild->lchild = AddNewNode(5);
	root->lchild->lchild->rchild = AddNewNode(6);
	root->lchild->lchild->rchild->rchild = AddNewNode(7);

	printf("二叉树的层次遍历:");
	bfs(root);
	printf("\n二叉树的前序遍历:");
	PreOrder(root);
	printf("\n\n");
	system("pause");
	return 0;
}

遍历结果：