bitrleiterator.h

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

#include "LinQueue.h"							//包含链式队列类

template <class T> class BiTrLeIterator: public BiTreeIterator<T>
{
protected:
	LinQueue<BiTreeNode<T> *> Q;		// 保存二叉树结点指针的队列
public:
	BiTrLeIterator(BiTreeNode<T>* &tree):
	  BiTreeIterator<T>(tree){}

	virtual void Next(void);
	virtual void Reset(void);
};

template <class T>
void BiTrLeIterator<T>::Reset(void)
{
	if(root == NULL) iteComplete = 1;	
	else  iteComplete = 0;

	if(root == NULL) return;
	current = root;							//根结点指针为当前结点指针
	if(root->Left() != NULL) Q.Append(root->Left());//左子树入队列
	if(root->Right() != NULL) Q.Append(root->Right());//右子树入队列
}

template <class T>
void BiTrLeIterator<T>::Next(void)
{
	if(iteComplete == 1)
	{
		cout << "已到二叉树尾!" << endl;
		exit(0);
	}
	if(Q.NotEmpty())
	{
		current = Q.Delete();				//出队列取得当前结点指针
		//左子树的根结点指针入队列
		if(current->Left() != NULL) Q.Append(current->Left());
		//右子树的根结点指针入队列
		if(current->Right() != NULL) Q.Append(current->Right());
	}
	else
		iteComplete = 1;					//队列空时置结束标记为1
}