//任务:将二叉树的叶结点按照从左到右的顺序连成一个单链表
BiTree pre = NULL, head;
BiTree leaf(BiTree& p)
{
if (p) {
if (p->lchild == NULL && p->rchild == NULL)
if (pre == NULL)
{
pre = p; head = pre;
}
else
{
pre->rchild = p;
pre = p;
}
leaf(p->lchild);
leaf(p->rchild);
pre->rchild = NULL;
}
return head;
}