midorder.cpp

来自「常用算法与数据结构原代码」· C++ 代码 · 共 37 行

#include <iostream.h>

typedef struct node{
	char data;
	node *lchild;
	node *rchild;
} TNODE;

typedef struct snode{
	TNODE *t;
	snode *link;
} SNODE;

void st_midorder(TNODE *t)
{
	SNODE *top=NULL,*p;
	while (t!=NULL || top!=NULL)
	{
		while (t!=NULL)
		{
			p=new SNODE;
			p->t=t;
			p->link=top;
			top=p;
			t=t->lchild;
		}
		if (top!=NULL)
		{
			t=top->t;
			p=top;
			top=top->link;
			delete p;
			cout<<t->data<<endl;
			t=t->rchild;
		}
	}
}