BST.cpp

#include<iostream>
using namespace std;
 class Node{
    public:
    int data;
    Node* left;
    Node* right;
    Node(int d){
        this->data=d;
        this->left=NULL;
        this->right=NULL;
    }
 };

Node* insertIntoBST(Node* root,int d){
    //base case
    if(root == NULL){
        root= new Node(d);
        return root;
    }
    if(d > root-> data){
        root -> right = insertIntoBST(root->right, d);
    }
    else{
        root -> left = insertIntoBST(root->left, d);
    }
    return root;
}

void takeInput(Node* &root){
    int data;
    cin>>data;

    while(data != -1){
        root = insertIntoBST(root,data);
            cin>>data;
        
    }
}

int main(){
    Node* root;
    cout<<"Enter datab to create BST"<<endl;
    takeInput(root);
    return 0;
}