C Program to find min and max in binary search tree(Recursive)

By | 16.04.2017

Min and Max in binary search tree(Recursive)


Write a C Program to find min and max in binary search tree. Here’s simple Program to find minimum and maximum value in binary search tree in C Programming Language.


What is Tree ?


In linear data structure, data is organized in sequential order and in non-linear data structure, data is organized in random order. Tree is a very popular data structure used in wide range of applications.

A tree data structure can be defined as follows…

  • Tree is a non-linear data structure which organizes data in hierarchical structure and this is a recursive definition.

A tree data structure can also be defined as follows…

  • Tree data structure is a collection of data (Node) which is organized in hierarchical structure and this is a recursive definition.

Every individual element is called as Node. Node in a tree data structure, stores the actual data of that particular element and link to next element in hierarchical structure.


Below is the source code for C Program to find min and max in binary search tree which is successfully compiled and run on Windows System to produce desired output as shown below :


SOURCE CODE : :


/*  C Program to find min and max in binary search tree  */

#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);
        }
}/*End of display()*/

OUTPUT : :


/*  C Program to find min and max in binary search tree  */

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 6

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 8

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 7

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 9

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 3

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 4

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 1

Enter the key to be inserted : 2

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 2


        9
    8
        7
6
        4
    3
        2

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 3

Minimum key is 2

Maximum key is 9

1.Insert
2.Display
3.Find minimum and maximum
4.Quit

Enter your choice : 4

Process returned 1

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.


Thanks for reading the post….

3 2 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments