#include <iostream>
using namespace std;

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

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

void Insert(Node **root, int data) 
{
    if (*root == NULL) { // empty tree
        *root = GetNewNode(data);
    }
    else if ((*root)->data < data) {
        Insert(&((*root)->left), data);
    }
    else {
        Insert(&((*root)->right), data);
    }
}

int main(int argc, char *argv[])
{
    Node *treeRoot = NULL;

    Insert(&treeRoot, 15);
    Insert(&treeRoot, 23);
    Insert(&treeRoot, 10);

}