二叉树求改错
输出二叉树中的叶子结点void bitreeleaf(bitree bt)
{
if(bt!=NULL)
return;
else if(bt->lchild==NULL&&bt->rchild==NULL)
printf("%c",bt->data);
else
{
bitreeleaf(bt->lchild);
bitreeleaf(bt->rchild);
}
}
2013-11-24 15:43
2013-11-25 17:30
2013-11-25 17:32
2013-11-25 22:31