帮我看一下非递归遍历二叉数的算法

[hanzq]

struct btnode
{ char data;
struct btnode * lchild;
struct btonde * rchild;
};
struct node
{ struct btnode *addr;
struct node *link;
};
inorder(root)
struct btnode * root;
{
struct node *top,*p;
top=NULL;
while(root!=NULL||top!=NULL)
{
while(root!=NULL)
{
struct node * p=(struct node *)malloc(sizeof(struct node));
p->addr=root;
p->link=top;
top=p;
root=root->lchild;
}
if(top!=NULL)
{
root=top->addr;
printf("%c",root->data);
p=top;
top=top->link;
free(p);
root=root->rchild;
}
}return;
}
这段代码编译出错 ：“undefimed structure 'btonde' in function inorder”
其他没有语法错误

怎么改？

[freefalcon]

粗心，写错了

struct btnode
{ char data;
struct btnode * lchild;
struct btnode * rchild; //btnode
};

[zhouqingyuan]

自己看编译信息！！！

[cngdzhang]

#include <stdio.h>
#include <stdlib.h>

struct btnode
{ char data;
struct btnode * lchild;
struct btnode * rchild;
};
struct node
{ struct btnode *addr;
struct node *link;
};

void inorder(struct btnode *root)
{
struct node *top,*p;
top=NULL;
while(root!=NULL||top!=NULL)
{
while(root!=NULL)
{
struct node * p=(struct node *)malloc(sizeof(struct node));
p->addr=root;
p->link=top;
top=p;
root=root->lchild;
}
if(top!=NULL)
{
root=top->addr;
printf("%c",root->data);
p=top;
top=top->link;
free(p);
root=root->rchild;
}
}return;
}

void main()
{
}

[junnyfeng]

struct btnode
{ char data;
struct btnode * lchild;
struct btonde * rchild; //这里btnode写错了
};
后面的最好也检查一下

[hewittlee]

struct btonde * rchild; //小心点