CppDSA/72_binarySearchTree_searching.cpp at main · Rishav07-05/CppDSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
using namespace std;
class node{
    public:
        int data;
        node *left;
        node *right;
    node(int d){
        this->data = d;
        this->left = nullptr;
        this->right = nullptr;
    }
};

node* insertIntoBST(node* root , int d){
    if(root == nullptr) {
        return new node(d);
    }
    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;
    }
}


// recursive way

// bool searchInBST(node *root, int n)
// {
//     if(root == nullptr)
//         return false;
//     if(root -> data == n)
//         return true;

//     if(n > root -> data){
//         return searchInBST(root->right , n);
//     }
//     else{
//         return searchInBST(root->left, n);
//     }
// }


// iterative way

bool searchBST(node* root , int n){
    node *temp = root;
    while(temp != nullptr){
        if (temp->data == n)
            return true;
        if (n > temp->data)
            temp = temp->right;
        else
            temp = temp->left;
    }
    return false;
}

int main(){
    node *root = nullptr;
    takeInput(root);
    int n;
    cin >> n;
    // if(searchInBST(root , n)){
    //     cout  << n << " Is present" << endl;
    // }
    // else{
    //     cout<< n << " Is not present" << endl;
    // }
    if(searchBST(root , n)){
        cout  << n << " Is present" << endl;
    }
    else{
        cout<< n << " Is not present" << endl;
    }
    return 0;
}