bst_insert.cc

node *insert(node *root, int value) {
    node *current = root;
    node *prev;

    if (root == NULL) {
        root = (node *)malloc(sizeof(node));
        root->data = value;
        root->left = NULL;
        root->right = NULL;
        return root;
    }

    while (current != NULL) {
        if (value <= current->data) {
            prev = current;
            current = current->left;
        } else {
            prev = current;
            current = current->right;
        }
    }
    node *next = (node *)malloc(sizeof(node));
    next->data = value;
    next->left = NULL;
    next->right = NULL;
    if (value <= prev->data) {
        prev->left = next;
    } else {
        prev->right = next;
    }
    return root;
}