void last2_order (BTreeNode *node)
{
if (node == NULL)
{
errno = ERROR;
return;
}
LinkStack *Stack = Create_Stack ();
BTreeNode *tmp = node; //指向当前节点
BTreeNode *pre = NULL; //指向被输出的节点
Push (Stack,tmp);
while (StackEmpty (Stack) != TRUE)
{
GetTop (Stack,&tmp);
//若P不存在左孩子和右孩子，或者P存在左孩子或右孩子，但左右孩子已经被输出
if(tmp->lchild == NULL && tmp->rchild == NULL
|| pre != NULL &&(tmp->lchild == pre || tmp->rchild == pre))
{
Pop (Stack,&tmp);
printf("L",tmp->data);
pre = tmp;//指向被输出的节点
continue;
}
if(tmp->rchild)
{
Push (Stack,tmp->rchild);
}
if(tmp->lchild)
{
Push (Stack,tmp->lchild);
}
}
}
