binarysearchtree

//author : raj patil
//जय हिंद, जय महाराष्ट्र !

//BST-Implementaion

#include<bits/stdc++.h>
using namespace std;

struct Node{
    int data;
    Node* right;
    Node* left;
};

Node* newNode(int x){
    Node* temp=new Node();
    temp->data=x;
    temp->right=NULL;
    temp->left=NULL;
    return temp;
}

Node* Insert(Node* root, int x){
    if(root==NULL) root=newNode(x);
    else if(x<=root->data) root->left=Insert(root->left,x);
    else root->right=Insert(root->right,x);
    return root;
}

bool search(Node* root, int x){
    if(root=NULL) return false;
    else if(root->data==x) return true;
    else if(x<=root->data) return search(root->left,x);
    else return search(root->right,x);
}

int main(){
    Node* root=NULL;
    root = Insert(root,15);	
	root = Insert(root,10);	
	root = Insert(root,20);
	root = Insert(root,25);
	root = Insert(root,8);
	root = Insert(root,12);

    int n;
    cin>>n;
    if(search(root,n)==true) cout<<"Number Present";
    else cout<<"Not Present";
}