bitrthiteratortest.cpp

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

#include <iostream.h>

#include "BiTrThNode.h"
#include "BiTreeThExample.h"
#include "InThreadIterator.h"

void main(void)
{
	BiTrThNode<char> *root2;

	MakeCharThTree(root2, 2);
	InThreadIterator<char> threadIter(root2);
	threadIter.CreatInThread();
	
	cout << "二叉树的中序正向遍历序列为：";
	for(threadIter.First(); !threadIter.EndOfNext(); threadIter.Next())
		cout << threadIter.Data() << "   ";
	cout << endl << "二叉树的中序反向遍历序列为：";
	for(threadIter.Last(); !threadIter.EndOfPrior(); threadIter.Prior())
		cout << threadIter.Data() << "   ";
}