inorder.h

该程序完成对二叉树的非递归中序遍历

#include<iostream.h>
#include"treenode.h"
#include"stack.h"

template<class T>
void InorderVisit(TreeNode<T> *t)
{
	Stack<TreeNode<T> *> s;
	TreeNode<T> *current=t;
	while(current!=NULL || !s.StackEmpty())
		if(current!=NULL)
		{
			s.Push(current);
			current=current->Left();
		}
		else
		{
			current=s.Pop();
			cout<<current->data<<" ";
			current=current->Right();
		}
		cout<<endl;
}