Scribd
Upload
3 views5 pages

19

This C program implements a binary search tree with functionalities to insert nodes, display the tree, and find the minimum and maximum values. The user can interact with the program through a menu-driven interface. The program continues to run until the user chooses to quit.

Uploaded by

msigf1810
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views5 pages

19

This C program implements a binary search tree with functionalities to insert nodes, display the tree, and find the minimum and maximum values. The user can interact with the program through a menu-driven interface. The program continues to run until the user chooses to quit.

Uploaded by

msigf1810
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

#include<stdio.

h>

#include<stdlib.h>

struct node

struct node *lchild;

int info;

struct node *rchild;

};

struct node *insert(struct node *ptr, int ikey);

struct node *Min(struct node *ptr);

struct node *Max(struct node *ptr);

void display(struct node *ptr,int level);

int main( )

struct node *root=NULL,*ptr;

int choice,k;

while(1)

printf("\n");

printf("1.Insert\n");

printf("2.Display\n");

printf("3.Find minimum and maximum\n");

printf("4.Quit\n");

printf("\nEnter your choice : ");

scanf("%d",&choice);

switch(choice)
{

case 1:

printf("\nEnter the key to be inserted : ");

scanf("%d",&k);

root = insert(root, k);

break;

case 2:

printf("\n");

display(root,0);

printf("\n");

break;

case 3:

ptr = Min(root);

if(ptr!=NULL)

printf("\nMinimum key is %d\n", ptr->info );

ptr = Max(root);

if(ptr!=NULL)

printf("\nMaximum key is %d\n", ptr->info );

break;

case 4:

exit(1);

default:

printf("\nWrong choice\n");

}/*End of switch */

}/*End of while */

return 0;
}/*End of main( )*/

struct node *insert(struct node *ptr, int ikey )

if(ptr==NULL)

ptr = (struct node *) malloc(sizeof(struct node));

ptr->info = ikey;

ptr->lchild = NULL;

ptr->rchild = NULL;

else if(ikey < ptr->info) /*Insertion in left subtree*/

ptr->lchild = insert(ptr->lchild, ikey);

else if(ikey > ptr->info) /*Insertion in right subtree */

ptr->rchild = insert(ptr->rchild, ikey);

else

printf("\nDuplicate key\n");

return ptr;

}/*End of insert( )*/

struct node *Min(struct node *ptr)

if(ptr==NULL)

return NULL;

else if(ptr->lchild==NULL)

return ptr;

else

return Min(ptr->lchild);
}/*End of min()*/

struct node *Max(struct node *ptr)

if(ptr==NULL)

return NULL;

else if(ptr->rchild==NULL)

return ptr;

else

return Max(ptr->rchild);

}/*End of max()*/

void display(struct node *ptr,int level)

int i;

if(ptr == NULL )/*Base Case*/

return;

else

display(ptr->rchild, level+1);

printf("\n");

for (i=0; i<level; i++)

printf(" ");

printf("%d", ptr->info);

display(ptr->lchild, level+1);

You might also like