BST.cpp

#include <iostream>

using namespace std;

class Node {
public:
    int data;
    Node* left;
    Node* right;

    Node(int x) {
        data = x;
        left = right = nullptr;
    }
};

class BST {
public:
    Node* root;

    BST() {
        root = nullptr;
    }

    Node* insert(Node* node, int x) {
        if (!node) return new Node(x);
        if (x < node->data)
            node->left = insert(node->left, x);
        else
            node->right = insert(node->right, x);
        return node;
    }

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

    void inorder(Node* node) {
        if (!node) return;
        inorder(node->left);
        cout << node->data << " ";
        inorder(node->right);
    }
};