bitrleiteratortest.cpp

数据结构c++-书的一些源代码

#include <iostream.h>
#include <stdlib.h>

#include "BiTreeNode.h"						//包含二叉树结点类
#include "BiTreeLib.h"						//包含二叉树结点操作函数
#include "BiTreeIterator.h"					//包含二叉树遍历游标类
#include "BiTrLeIterator.h"					//包含二叉树层序遍历游标类

void MakeCharTree(BiTreeNode<char>*  &root)
//构造图7-10（a）所示的不带头结点的二叉链存储结构的二叉树
{
	BiTreeNode<char> *a, *b, *c, *d, *e, *f, *g, *null = NULL;

	g = GetTreeNode('G');
	d = GetTreeNode('D', null, g);
	b = GetTreeNode('B', d);
	e = GetTreeNode('E');
	f = GetTreeNode('F');
	c = GetTreeNode('C', e, f);
	root = GetTreeNode('A', b, c);
}

void main(void)
{
	BiTreeNode<char> *root;

	MakeCharTree(root);
	BiTrLeIterator<char> myIter(root);	//定义二叉树层序遍历游标类对象

	cout << "层序遍历序列为：";
	for(myIter.Reset(); !myIter.EndOfBiTree(); myIter.Next())
		cout << myIter.Data() << "    ";
}