InsertionInABST.cpp

#include<iostream>
#include<cstdlib>
usingnamespacestd;

structnode {
int data;
structnode *left, *right;
};

// Create a node
structnode *createnode(int item) {
structnode *temp = (structnode *)malloc(sizeof(structnode));
 temp->data = item;
 temp->left = temp->right = NULL;
return temp;
}
voidinorder(structnode *root) {
if (root != NULL) {
inorder(root->left);
 cout << root->data << "";
inorder(root->right);
 }
}
intsearch(structnode *root, int key){
structnode *prev = NULL;
while(root!=NULL){
 prev = root;
if(key==root->data){
printf("Cannot insert %d, already in BST", key);
return1;
 }
elseif(key<root->data){
 root = root->left;
 }
else{
 root = root->right;
 }
 }
return0;
}
structnode *insert(structnode *node, int key) {
if(search(node,key)==0){

if (node == NULL){
returncreatenode(key);
 }
if (key < node->data){
 node->left = insert(node->left, key);
 }
else{
 node->right = insert(node->right, key);
 }
 }

return node;
}


intmain() {
structnode *root = NULL;
int ch;
int x;
 cout<<"Press 0 to exit else enter 1: ";
 cin>>ch;
while(ch!=0)
 {
 cout<<"\n"<<"1.Insertion"<<"\n"<<"2.View"<<"\n";
 cout<<"\n"<<"Enter choice :";
 cin>>ch;
switch (ch)
 {
case1:
 cout<<"Enter the value you want to insert in binary search tree: ";
 cin>>x;
 root = insert(root, x);
break;
case2:
 cout << "Inorder traversal: ";
inorder(root);
break;

default:
printf("\nINVALID CHOICE !!");
break;
 }
 }
return0;


}