push中少了一句:
stack[stack->top].rchild=p->rchild;//增加
详见下面代码:
#include <stdio.h>
#include <stdlib.h>
typedef struct bnode
{
char data;
struct bnode *lchild;
struct bnode *rchild;
int top;
}bnode;
bnode stack[100];
void initstack(bnode * stack)
{
stack->top=-1;
}
void push(bnode*stack,bnode*p)
{
if(p)
{
stack->top++;
stack[stack->top].data=p->data;
stack[stack->top].rchild=p->rchild;//增加
}
}
void pop(bnode*stack)
{
stack->top--;
}
int stackempty(bnode*stack)
{
if (stack->top==-1)
return 0;
return 1;
}
bnode * top(bnode*stack)
{
bnode* t=&stack[stack->top];
return t;
}
void stackmidread(bnode*root)
{
bnode*p=root;
initstack(stack);
while(p || stackempty(stack)==1)
{
while(p)
{
push(stack,p);
p=p->lchild;
}
if (stackempty(stack)==1)
{
p=top(stack);
printf("%c", p->data);
pop(stack);
p=p->rchild;
}
}
}
bnode * createtree()
{
char ch;
bnode *p;
ch=getchar();
if (ch=='#')
p=NULL;
else
{
p=(bnode*)malloc(sizeof(bnode));
p->data=ch;
p->lchild=createtree();
p->rchild=createtree();
}
return p;
}
void main()
{
bnode *root=createtree();
stackmidread(root);
}