二叉树后序遍历的非递归算法

 #include<stdio.h>
#include <stdlib.h>
#define maxsize 50
typedef struct Bnode //声明二叉树的数据结构
{
char data;
struct Bnode *lchild,*rchild;
}bnode,*btree;
typedef struct type
{
btree node;
int flag;
}datatype,*pdatatype;
typedef struct{ //声明栈的数据结构
datatype data[maxsize];//pdatatype data[maxsize]; //类型改为datatype
int top;
}seqstack,*pseqstack;
int i=0;
btree creatbtree(char *s) //创建二叉树
{
btree t;
if(s[i]=='#')
{t=NULL;i++;}
else
{
t=(btree)malloc(sizeof(bnode));
t->data=s[i];i++;
t->lchild=creatbtree(s);
t->rchild=creatbtree(s);
}
return t;
}
void postorder(btree t) //二叉树的后序遍历(非递归)
{
int cout;
pseqstack p;
//pdatatype sq;
//sq=(pdatatype)malloc(sizeof(datatype));
p=(pseqstack)malloc(sizeof(seqstack));
p->top=0;
while(t||!(p->top==0))
{
if(t)
{
//sq->flag=0;
//sq->node=t;
//p->data[p->top]=sq;
p->data[p->top].node = t;
p->data[p->top].flag = 0;
(p->top)++;
t=t->lchild;
}
else
{ 
//sq=p->data[(p->top)-1];
//t=sq->node;
if(p->data[p->top-1].flag==0)
{ 
p->data[p->top-1].flag=1;
//sq->node=t;
//p->data[p->top]=sq;
//(p->top)++;
t = p->data[p->top-1].node->rchild;//t=t->rchild;
}
else
{
printf("%c",p->data[p->top-1].node->data); //printf("%c",t->data);
    (p->top)--;

//printf("%c",t->data);
//t=NULL;

}
}
}
}




main()
{
btree t;
char *s;
s="abd#g###ce##fh###";
t=creatbtree(s);
printf("/n后序遍历：");
postorder(t);


}