C++ Program to Find the Node with Minimum Value in a Binary Search Tree

This C++ program, displays the minimum element present in a binary search tree.

Here is the source code of the C++ program which creates a binary search tree on the basis of the inputs given and goes on traversing left from the root until the least value is encountered. This C++ program is successfully compiled and run on DevCpp, a C++ compiler. The program output is also shown below.

```
/*
```

 * C++ Program to Find the Minimum value of Binary Search Tree

```
 */
```
```
#include <iostream>
```
```
using namespace std;
```
```
#include <conio.h>
```
```
struct tree
```
```
{
```
```
    tree *l, *r;
```
```
    int data;
```

}*root = NULL, *p = NULL, *np = NULL, *q;

```
 
```
```
 
```
```
void create()
```
```
{
```
```
    int value, c = 0;   
```
```
    while (c < 7)
```
```
    {
```
```
        if (root == NULL)
```
```
        {
```
```
            root = new tree;
```

            cout<<"enter value of root node\n";

```
            cin>>root->data;
```
```
            root->r=NULL;
```
```
            root->l=NULL;
```
```
        }
```
```
        else
```
```
        {
```
```
            p = root;
```

            cout<<"enter value of node\n";

```
            cin>>value;
```
```
            while(true)
```
```
            {
```
```
                if (value < p->data)
```
```
                {
```
```
                    if (p->l == NULL)
```
```
                    {
```

                        p->l = new tree;

```
                        p = p->l;
```

                        p->data = value;

```
                        p->l = NULL;
```
```
                        p->r = NULL;
```

                        cout<<"value entered in left\n";

```
                        break;
```
```
                    }
```
```
		    else if (p->l != NULL)
```
```
		    {
```
```
		        p = p->l;
```
```
		    }
```
```
                }
```
```
		else if (value > p->data)
```
```
		{
```
```
		    if (p->r == NULL)
```
```
		    {
```
```
		        p->r = new tree;
```
```
		        p = p->r;
```

                        p->data = value;

```
                        p->l = NULL;
```
```
                        p->r = NULL;
```

		        cout<<"value entered in right\n";

```
	                break;
```
```
		    }
```
```
		    else if (p->r != NULL)
```
```
		    {
```
```
                        p = p->r;
```
```
		    }
```
```
		}
```
```
	    }
```
```
        }
```
```
        c++;
```
```
    }
```
```
}
```
```
int inorder(tree *p)
```
```
{
```
```
    int min;
```
```
    while (p->l != NULL)
```
```
    {
```
```
        p = p->l;
```
```
    }
```
```
    return(p->data);
```
```
}
```
```
int main()
```
```
{
```
```
 create();
```
```
 x=inorder(root);
```

 cout<<"Minimum value in tree:"<<x<<endl;

```
 getch();
```
```
}
```

Output
enter value of root node
8
enter value of node
9
value entered in right
enter value of node
6
value entered in left
enter value of node
5
value entered in left
enter value of node
10
value entered in right
enter value of node
4
value entered in left
enter value of node
3
value entered in left
Minimum value in tree:3

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

Subscribe Now: Data Structures in C++ Newsletter | Important Subjects Newsletters

If you wish to look at all C++ Programming examples, go to C++ Programs.

« Prev - C++ Program to Check if a Tree is Binary Search Tree

» Next - C++ Program to Create Expression Tree from Prefix Expression

Next Steps: