K.

Ramakrishnan College of Engineering, Trichy

EX.NO:6 BINARY SEARCH TREE

DATE:24.10.2020

Aim:

To write a c program to perform binary search tree and its operations.

Algorithm:

1. Start the program.

2. Create a structure with key and 2 pointer variable left and right
3. Read the node to be inserted.
 If (root==NULL),then root=node
 else if (root->key<node->key) ,then root->right=NULL
 else Root->left=node
4 For Deletion
 if it is a leaf node
1. Remove immediately
2. Remove pointer between del node & child
 if it is having one child
1. Remove link between del node&child
2. Link delnode is child with delnodes parent
 If it is a node with a children
1. Find min value in right subtree
2. Copy min value to delnode place
3. Delete the duplicate
5 Stop the program.

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

PROGRAM:
#include <stdio.h>
#include <stdlib.h>
struct btnode
{
int value;
struct btnode *l;
struct btnode *r;
}*root = NULL, *temp = NULL, *t2, *t1;
void delete1();
void insert();
void delete();
void inorder(struct btnode *t);
void create();
void search(struct btnode *t);
void preorder(struct btnode *t);
void postorder(struct btnode *t);
void search1(struct btnode *t,int data);
int smallest(struct btnode *t);
int largest(struct btnode *t);
int flag = 1;
void main()
{
int ch;
printf("\nOPERATIONS ---");
printf("\n1 - Insert an element into tree\n");
printf("2 - Delete an element from the tree\n");
printf("3 - Inorder Traversal\n");
printf("4 - Preorder Traversal\n");
printf("5 - Postorder Traversal\n");
printf("6 - Exit\n");
while(1)
{
printf("\nEnter your choice : ");
Department of Computer Science and Engineering Page
 K. Ramakrishnan College of Engineering, Trichy

scanf("%d", &ch);
switch (ch)
{
case 1:
insert();
break;
case 2:
delete();
break;
case 3:
inorder(root);
break;
case 4:
preorder(root);
break;
case 5:
postorder(root);
break;
case 6:
exit(0);
default :
printf("Wrong choice, Please enter correct choice ");
break;
}
}
}

void insert()
{
create();
if (root == NULL)
root = temp;
else

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

search(root);
}

void create()
{
int data;

printf("Enter data of node to be inserted : ");

scanf("%d", &data);
temp = (struct btnode *)malloc(1*sizeof(struct btnode));
temp->value = data;
temp->l = temp->r = NULL;
}

void search(struct btnode *t)

{
if ((temp->value > t->value) && (t->r != NULL))
search(t->r);
else if ((temp->value > t->value) && (t->r == NULL))
t->r = temp;
else if ((temp->value < t->value) && (t->l != NULL))
search(t->l);
else if ((temp->value < t->value) && (t->l == NULL))
t->l = temp;
}

void inorder(struct btnode *t)

{
if (root == NULL)
{
printf("No elements in a tree to display");
return;
}
Department of Computer Science and Engineering Page
 K. Ramakrishnan College of Engineering, Trichy

if (t->l != NULL)
inorder(t->l);
printf("%d -> ", t->value);
if (t->r != NULL)
inorder(t->r);
}

void delete()
{
int data;

if (root == NULL)
{
printf("No elements in a tree to delete");
return;
}
printf("Enter the data to be deleted : ");
scanf("%d", &data);
t1 = root;
t2 = root;
search1(root, data);
}

void preorder(struct btnode *t)

{
if (root == NULL)
{
printf("No elements in a tree to display");
return;
}
printf("%d -> ", t->value);
if (t->l != NULL)
preorder(t->l);

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

if (t->r != NULL)
preorder(t->r);
}

void postorder(struct btnode *t)

{
if (root == NULL)
{
printf("No elements in a tree to display ");
return;
}
if (t->l != NULL)
postorder(t->l);
if (t->r != NULL)
postorder(t->r);
printf("%d -> ", t->value);
}

void search1(struct btnode *t, int data)

{
if ((data>t->value))
{
t1 = t;
search1(t->r, data);
}
else if ((data < t->value))
{
t1 = t;
search1(t->l, data);
}
else if ((data==t->value))
{
delete1(t);

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

}
}

void delete1(struct btnode *t)

{
int k;
if ((t->l == NULL) && (t->r == NULL))
{
if (t1->l == t)
{
t1->l = NULL;
}
else
{
t1->r = NULL;
}
t = NULL;
free(t);
return;
}
else if ((t->r == NULL))
{
if (t1 == t)
{
root = t->l;
t1 = root;
}
else if (t1->l == t)
{
t1->l = t->l;

}
else

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

{
t1->r = t->l;
}
t = NULL;
free(t);
return;
}
else if (t->l == NULL)
{
if (t1 == t)
{
root = t->r;
t1 = root;
}
else if (t1->r == t)
t1->r = t->r;
else
t1->l = t->r;
t == NULL;
free(t);
return;
}
else if ((t->l != NULL) && (t->r != NULL))
{
t2 = root;
if (t->r != NULL)
{
k = smallest(t->r);
flag = 1;
}
else
{
k =largest(t->l);

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

flag = 2;
}
search1(root, k);
t->value = k;
}

int smallest(struct btnode *t)

{
t2 = t;
if (t->l != NULL)
{
t2 = t;
return(smallest(t->l));
}
else
return (t->value);
}

int largest(struct btnode *t)

{
if (t->r != NULL)
{
t2 = t;
return(largest(t->r));
}
else
return(t->value);
}

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

Output:

OPERATIONS ---

1 - Insert an element into tree

2 - Delete an element from the tree

3 - Inorder Traversal

4 - Preorder Traversal

5 - Postorder Traversal

6 - Exit

Enter your choice : 1

Enter data of node to be inserted : 1

Enter your choice : 1

Enter data of node to be inserted : 23

Enter your choice : 1

Enter data of node to be inserted : 25

Enter your choice : 1

Enter data of node to be inserted : 48

Enter your choice : 1

Enter data of node to be inserted : 65

Enter your choice : 3

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

1 -> 23 -> 25 -> 48 -> 65 ->

Enter your choice : 4

1 -> 23 -> 25 -> 48 -> 65 ->

Enter your choice : 5

65 -> 48 -> 25 -> 23 -> 1 ->

Enter your choice : 2

Enter the data to be deleted : 1

Enter your choice : 3

23 -> 25 -> 48 -> 65 ->

Enter your choice : 7

Wrong choice, Please enter correct choice

Enter your choice : 6

Result:
Thus the c program to perform binary search tree has been executed
successfully.

Department of Computer Science and Engineering Page

 K. Ramakrishnan College of Engineering, Trichy

Department of Computer Science and Engineering Page