数据结构——026树的层次遍历

#include <iostream>
using namespace std;
#define MaxSize 50
typedef int ElemType;
typedef struct BT {
	ElemType data;
	struct BT* lchild;
	struct BT* rchild;
}BT, *BiTree;
typedef struct Queue{
	BiTree data[MaxSize];
	int front;
	int rear;
}SqQueue;
void init(SqQueue &q) {
	q.front = 0;
	q.rear = 0;
}
void enqueue(SqQueue &q, BiTree e) {
		q.data[q.rear++] = e;
}
BiTree dequeue(SqQueue &q) {
	return q.data[q.front++];
}
BiTree Create_T() {
	BiTree T = new BT; T->data = 1;
	T->lchild = new BT; T->lchild->data = 2;
	T->rchild = new BT; T->rchild->data = 3;
	T->lchild->lchild = new BT; T->lchild->lchild->data = 4;
	T->lchild->rchild = new BT; T->lchild->rchild->data = 5;
	T->rchild->rchild = new BT; T->rchild->rchild->data = 6;
	T->lchild->lchild->lchild = NULL;
	T->lchild->lchild->rchild = NULL;
	T->lchild->rchild->lchild = NULL;
	T->lchild->rchild->rchild = NULL;
	T->rchild->lchild = NULL;
	T->rchild->rchild->lchild = NULL;
	T->rchild->rchild->rchild = NULL;
	return T;
}

//层次遍历
void rank_order(BiTree T) {
	SqQueue q;
	init(q);
	BiTree p = T;
	enqueue(q, p);
	while (q.front != q.rear) {
		BiTree s = dequeue(q);
		cout << s->data << " ";
        if(s->lchild)
			enqueue(q, s->lchild);
        if(s->rchild)
			enqueue(q, s->rchild);
	}
}
int main()
{
	BiTree T = Create_T();
	rank_order(T);
	return 0;
}