typedef char BTreeData;
// 二叉树的结点
typedef struct _btreeNode
{
BTreeData data;
struct _btreeNode *lchild; // 指向左孩子结点的指针
struct _btreeNode *rchild; // 指向右孩子结点的指针
}BTreeNode;
// 二叉树
typedef struct _btree
{
BTreeNode *root; // 指向二叉树的根节点
int count; // 记录二叉树结点的个数
}BTree;
BTree *Create_BTree()
{
BTree *btree = (BTree*)malloc(sizeof(BTree)/sizeof(char));
if (btree == NULL)
return NULL;
btree->count = 0;
btree->root = NULL;
return btree;
}
//非递归中序遍历
void mid_order (BTreeNode *node)
{
if (node == NULL)
{
errno = ERROR;
return;
}
LinkStack *Stack = Create_Stack ();
BTreeNode *tmp = node; //指向当前节点
while (tmp)
{
Push (Stack,tmp);
if (tmp->lchild)
{
tmp = tmp->lchild;
continue;
}
tmp = tmp->rchild;
while(StackEmpty(Stack) != TRUE && tmp == NULL)
{
Pop (Stack,&tmp);
printf("L",tmp->data);
tmp = tmp->rchild;
}
}
}
