有待指正的算法实现
void DeleteLeaf(BiTNode &T){
if(!T) return null;
if(T->lchild==null!T->rchild==null) {
free(T);
return ;
}
if(T->lchild) Delete(T->lchild);
if(T->rchild) Delete(T->rchild);
}
void DeleteLeaf(BiTNode &T){
if(!T) return ;
if(!T->lchild&&!T->rchild) {
free(T);
return;
}
InitQueue(Q);
BiTNode *p;
EnQueue(Q,T);
while(!isEmpty(Q)){
DeQueue(Q,p);
if(!T->lchild&&!T->rchild)
free(p);
if(T->lchild) EnQueue(Q,T->lchild);
if(T->rchild) EnQueue(Q,T->rchild);
}
}