bitriniteratortest.cpp

来自「包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等」· C++ 代码 · 共 33 行

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

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

void MakeCharTree(BiTreeNode<char>*  &root)
{
	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> *root2;

	MakeCharTree(root2);
	BiTrInIterator<char> biTreeIter(root2);

	for(biTreeIter.Reset(); !biTreeIter.EndOfBiTree(); biTreeIter.Next())
		cout << biTreeIter.Data() << "    ";
}