search_element_in_BST.cpp

//Write a program to search an element in BST

#include<bits/stdc++.h>
using namespace std;
struct node{
	int data;
	struct node* left;
	struct node* right;
};
struct node* root=NULL;
void createNode(int value){
	struct node* newNode=new node();
	newNode->data=value;
	newNode->left=NULL;
	newNode->right=NULL;

	if(root== NULL){
		root=newNode;
		return;
	}
	struct node* current=root;
	struct node* parent=NULL;
	while(current !=NULL){
		parent=current;
		if(value < current->data){
			current=current->left;
		}else{
			current=current->right;
		}
	}

	if(value < parent->data ){
		parent->left=newNode;
	}else{
		parent->right=newNode;
	}
}

bool searchElement(node* root, int item) {
    if (root == NULL) {
        return false;
    }
    if (root->data == item) {
        return true;
    }
    if (item < root->data) {
        return searchElement(root->left, item);
    } else {
        return searchElement(root->right, item);
    }
}
void nodeTravers(struct node* root){
	if(root==NULL){
		return;
	}
	cout<<root->data<<"  ";
	nodeTravers(root->left);
	nodeTravers(root->right);
}
int main(){
	int op;
	int x=1, value;
	while(x){
		cout<<endl<<"-------MENU--------"<<endl<<endl;
		cout<<"  1. Insert Node"<<endl;
		cout<<"  2. Display"<<endl;
		cout<<"  3. Search"<<endl;
		cout<<"  4. Exit"<<endl;
		cout<<"Enter any option:";
		cin>>op;

		switch(op){
			case 1:
				cout<<"Enter data:";
				cin>>value;
				createNode(value);
				break;
			case 2:
				nodeTravers(root);
				break;
			case 3:
				cout << "Enter searching element: ";
                cin >> value;
                if (searchElement(root, value)) {
                    cout << "Search is successful\n";
                } else {
                    cout << "Item not found\n";
                }
				break;
			case 4:
				x=0;
				break;
			default:
				cout<<"Enter correct option!!";
		}
	}
	return 0;
}