Scribd
Upload
50 views8 pages

A Program To Delete A Node From Binary Search Tree

The document describes a program to delete nodes from a binary search tree. It includes functions to insert nodes, search for a node, delete a node by handling cases where the node has zero, one, or two children, and traverse the tree using inorder traversal. The main function creates a binary search tree by inserting nodes, then deletes several nodes and prints the tree after each deletion to demonstrate the delete functionality.

Uploaded by

Biprajit Bhattacharjee
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
50 views8 pages

A Program To Delete A Node From Binary Search Tree

The document describes a program to delete nodes from a binary search tree. It includes functions to insert nodes, search for a node, delete a node by handling cases where the node has zero, one, or two children, and traverse the tree using inorder traversal. The main function creates a binary search tree by inserting nodes, then deletes several nodes and prints the tree after each deletion to demonstrate the delete functionality.

Uploaded by

Biprajit Bhattacharjee
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

A program to delete a node from binary search

tree
#include<alloc.h>
#define TRUE 1
#define FALSE 0
Struct btree node
{
Struct btreenode *leftchild;
Int data;
Struct btreenode *rightchild;
};
main();
{
Struct btreenode *bt;
Int req,i=0,numa[] = {11,9,13,8,10,12,14,15,7};
Bt= NULL, /”empty tree”/
Clrscr()
While(i<=8)
{
Insert(&bt,a[i]);
i++;
}
Clrscr();
Printf(“binary tree before deletion:”);
Inorder(bt);
Delete(&bt,10);
Printf(“/n Binary tree after deletion:”);
Inorder(bt);
Delete(&bt,14);
Printf(“/n Binary tree after deletion:”);
Inorder(bt);
Delete(&bt,8);
Printf(/n”Binary tree after deletion:”);
Inorder(bt);
Delete(&bt,13);
Printf(“/Binary tree after deletion:”);
Inorder(bt);
}
/*inserts a node in a binary search tree*/
Insert(struct btreenode **sr,int num)
{
{
If(*sr==NULL)
{
*sr=malloc(sizeof(struct btreenode));
(*sr)-> leftchild =NULL;
(*sr)->data=num;
(*sr)->rightchild=NULL;
Return;
}
else /*search the node to which new node will be attached */
{
/*if new data is less, traverse to left*/
If(num<(*sr)->data)
Insert(&((*sr)->leftchild),num);
Else
/* else traverse to right*/
Insert(&((*sr)->rightchild),num);
}
Return;
}
/* deletes a node from the binary search tree */
Delete(struct btreenode **root,int num)
{
Int found;
Struct btreenode *parent,*x,*xsucc;
/*if tree is empty*/
If(*root==NULL)
{
Printf(“/n Tree is empty”);
Return;
}
Parent = x= NULL;
/* call to search function to find the node to be deleted */
Search(root,num, &parent, &x, &found);
/*if the node to deleted is not found*/
If (found==FALSE)
{
Printf(“Data to be deleted, not found”);
Return;
}
/* if the node to be deleted has two children */
If(x->leftchild!=NULL&& x->rightchild!=NULL)
{
Parent=x;
Xsucc=x->rightchild;
While(xsucc->leftchild!=NULL)
{
Parent = xsucc;
Xsucc = xsucc->leftchild;
}
X->data =xsucc->data;
X = xsucc;
}
/* if the node to be deleted has no child */
If(x->leftchild==NULL&& x->rightchild==NULL)
{
If (parent->rightchild==x)
Parent ->rightchild=NULL;
Else
Parent->leftchild=NULL;
Free(x);
Return;
}
/* if the node to be deleted has only rightchild*/
If(x->leftchild==NULL && x->rightchild!=NULL)
{
If(parent->leftchild==x)
Parent->leftchild=x->rightchild;
Else
Parent->rightchild=x->rightchild;
Free(x);
Return;
}
/* if the node to be deleted has only left child */
If(x->leftchild!=NULL && x->rightchild == NULL)
{
If parent->leftchild==x)
parent->leftchild=x->leftchild;
Else
Parent->rightchild=x-> leftchild;
free(x);
Return;
}
}
/*returns the address of the node to be deleted, address of its parent and whether the node is
found or not */
Serch (struct btreenode **root, int num, struct btreenode **par, struct btreenode **x,int *
found)
{
Struct btreenode *q;
Q=*root;
*found = FALSE;
*par = NULL;
While (q!=NULL)
{
/* if the node to be deleted is found */
If (q-> data==num)
{
*found = TRUE;
*x=q;
Return;
}
If(q->data>num)
{
*par=q;
q=q->leftchild;
}
Else
{
*par=q;
q=q->rightcild;
}
}
}
/* traverse a binary search tree in a LDR(LEFT-DATA-RIGHT) fashion */
Inorder(struct btreenode *sr)
{
If(sr!=NULL)
{
Inorder(sr->leftchild);
/* print the data of the node whose left child is NULL or the path has already been traversed */

You might also like