struct Node

{

    int data;

    Node *left, *right;

};

// Function to create a new binary tree node having a given key

Node* newNode(int key)

{

    Node* node = new Node;

    node->data = key;

    node->left = node->right = nullptr;

    return node;

}

// Function to perform inorder traversal on the tree

void inorder(Node* root)

{

    if (root == nullptr) {

        return;

    }

    inorder(root->left);

    cout << root->data << " ";

    inorder(root->right);

}

// Recursive function to insert a key into a BST

Node* insert(Node* root, int key)

{

    // if the root is null, create a new node and return it

    if (root == nullptr) {

        return newNode(key);

    }

    // if the given key is less than the root node, recur for the left subtree

    if (key < root->data) {

        root->left = insert(root->left, key);

    }

    // if the given key is more than the root node, recur for the right subtree

    else {

        root->right = insert(root->right, key);

    }

    return root;

}