void Delete(BiTree& T)
{
if (!T)
return;
Delete(T->lchild);
Delete(T->rchild);
free(T);
}
void Finh_k(BiTree& T, int k)
{
if (T = NULL)
return;
if (T == k)
{
Delete(T);
T = NULL;
}
if (T)
{
Finh_k(T->lchild, k);
Finh_k(T->rchild, k);
}
}
删除结点为k的并释放
于 2022-03-26 16:10:34 首次发布