Write a C program to delete a tree ie free up its nodes?

Answer 1

void del(int item) { node *parent,*location;

if(root==NULL)

{ cout<<"Tree empty");

return; }

find(item,&parent,&location);

if(location==NULL)

{ cout<<"Item not present in tree";

return; }

if(location->lchild==NULL && location->rchild==NULL)

case_a(parent,location); if(location->lchild!=NULL && location->rchild==NULL) case_b(parent,location); if(location->lchild==NULL && location->rchild!=NULL) case_b(parent,location); if(location->lchild!=NULL && location->rchild!=NULL) case_c(parent,location);

free(location);

}/*End of del()*/

void find(int item,node **par,node **loc)

{ node *ptr,*ptrsave; if(root==NULL) /*tree empty*/

{ *loc=NULL; *par=NULL; return;

}

if(item==root->info) /*item is at root*/

{ *loc=root; *par=NULL; return; } /*Initialize ptr and ptrsave*/

if(item<root->info) ptr=root->lchild;

else

ptr=root->rchild;

ptrsave=root;

while(ptr!=NULL)

{

if(item==ptr->info)

{

*loc=ptr; *par=ptrsave;

return;

}

ptrsave=ptr;

if(item<ptr->info)

ptr=ptr->lchild;

else

ptr=ptr->rchild; }/*End of while */

*loc=NULL; /*item not found*/

*par=ptrsave; }/*End of find()*/