6.45.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

void ReleaseX(BiTree &bt, char x)
/* Delete all subtrees whose root is  */
/* the node which element value is x, */
/* then release correspondant space.  */
{
    BiTree p;
    p=bt;
    if(!p) return ;
    if(p->data==x||x==0) {        
        if(p->lchild)
        ReleaseX(p->lchild,0);
        if(p->rchild)
        ReleaseX(p->rchild,0);
        bt=NULL;
        free(p);
        return ;
    }
    if(p->lchild)
        ReleaseX(p->lchild,x);
    if(p->rchild)
        ReleaseX(p->rchild,x);
    return ;
    
}



void ReleaseX(BiTree &bt, char x)
/* Delete all subtrees whose root is  */
/* the node which element value is x, */
/* then release correspondant space.  */
{ if(bt->data==x)free(bt);
   else {
   if(bt->lchild)ReleaseX(bt->lchild,x);
   if(bt->rchild)ReleaseX(bt->rchild,x);
   }
}