#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
struct tree
{
int data;
struct tree *right;
struct tree *left;
}
*root=NULL,*curr;
void ins(struct tree **,struct tree*);
void min(struct tree *);
void max(struct tree *);
void main()
{
int choice;
char y;
while (1)
{
clrscr();
cout<<"\n1........Insert\n2.........Min\n3.......Find
Max\n4........Exit";
cin>>choice;
switch (choice)
{
case 1:
{
cout<<"\nEnter the data";
curr=new tree;
cin>>curr->data;
curr->right=NULL;
curr->left=NULL;
ins(&root,curr);
break;
}
case 2:
min(root);
break;
}
case 3:
{
max(root);
break;
}
case 4:
{
exit(4);
break;
}
getch();
docsity.com
