BST Insert Operation in DSA C++

Mental Model

A binary search tree keeps smaller values on the left and bigger values on the right. Inserting means finding the right empty spot to keep this order.

Analogy: Imagine placing books on a shelf where all books with smaller titles go to the left side and bigger titles go to the right side. You find the right empty spot by comparing titles one by one.

    5
   / \
  3   7
 / \   \
2   4   8
↑ root

Dry Run Walkthrough

Input: Insert value 6 into BST: 5 -> 3 -> 7 -> 2 -> 4 -> 8

Goal: Add 6 in the correct position to keep BST order

Step 1: Compare 6 with root 5, move right because 6 > 5

5 -> [curr->7]
/ \   \
3   7   8
/ \     
2   4    

Why: We go right because 6 is bigger than 5

Step 2: Compare 6 with 7, move left because 6 < 7

5 -> 7 -> [curr->null]
/ \   \
3   7   8
/ \     
2   4    

Why: We go left because 6 is smaller than 7

Step 3: Insert 6 as left child of 7

5 -> 7 -> 6
/ \   / \
3   7 6   8
/ \     
2   4    

Why: Found empty spot, insert 6 here to keep BST order

Result:

5 -> 3 -> 7 -> 2 -> 4 -> 6 -> 8

Annotated Code

DSA C++

#include <iostream>
using namespace std;

struct Node {
    int val;
    Node* left;
    Node* right;
    Node(int x) : val(x), left(nullptr), right(nullptr) {}
};

Node* insertBST(Node* root, int val) {
    if (root == nullptr) {
        return new Node(val); // create new node when spot found
    }
    if (val < root->val) {
        root->left = insertBST(root->left, val); // go left
    } else {
        root->right = insertBST(root->right, val); // go right
    }
    return root; // return unchanged root
}

void printInOrder(Node* root) {
    if (root == nullptr) return;
    printInOrder(root->left);
    cout << root->val << " ";
    printInOrder(root->right);
}

int main() {
    Node* root = new Node(5);
    root->left = new Node(3);
    root->right = new Node(7);
    root->left->left = new Node(2);
    root->left->right = new Node(4);
    root->right->right = new Node(8);

    root = insertBST(root, 6);

    printInOrder(root);
    cout << endl;
    return 0;
}

if (root == nullptr) { return new Node(val); }

create new node when empty spot found

if (val < root->val) { root->left = insertBST(root->left, val); }

go left if value smaller

else { root->right = insertBST(root->right, val); }

go right if value bigger or equal

return root;

return current root after insertion

Output

2 3 4 5 6 7 8 

Complexity Analysis

Time: O(h) where h is tree height because we follow one path down to insert

Space: O(h) due to recursion stack for the path from root to insertion point

vs Alternative: Compared to array insertions which can be O(n) due to shifting, BST insert is faster if tree is balanced

Edge Cases

Empty tree (root is nullptr)

New node becomes the root

DSA C++

if (root == nullptr) { return new Node(val); }

Insert duplicate value

Duplicates go to the right subtree by this code logic

DSA C++

else { root->right = insertBST(root->right, val); }

Insert smallest or largest value

Insertion goes to leftmost or rightmost leaf respectively

DSA C++

recursive calls until root == nullptr

When to Use This Pattern

When you need to add a value to a sorted tree structure while keeping order, use BST insert to find the correct spot efficiently.

Common Mistakes

Mistake: Not updating the parent's left or right pointer after recursive insert
Fix: Assign the recursive call result back to root->left or root->right

Mistake: Inserting duplicates on the left causing imbalance
Fix: Decide a consistent rule, here duplicates go right

Summary

Inserts a value into the binary search tree keeping its order.

Use when you want to add elements to a BST without breaking its sorted property.

The key is to find the empty spot by comparing values and moving left or right.

Practice

1. What is the main purpose of the insert operation in a Binary Search Tree (BST)?

easy

A. To delete a node from the BST

B. To find the height of the BST

C. To add a new node while maintaining BST properties

D. To traverse the BST in order

Solution

1. Step 1: Understand BST insert operation

   The insert operation adds a new node to the BST while keeping the order property intact: left child < parent < right child.

2. Step 2: Differentiate from other operations

   Deleting nodes, finding height, or traversing are different operations and do not describe insertion.

3. Final Answer:

   To add a new node while maintaining BST properties -> Option C

4. Quick Check:

   Insert = Add node maintaining order [OK]

Hint: Insert means add node keeping BST order intact [OK]

Common Mistakes:

• Confusing insert with delete operation
• Thinking insert changes tree height only
• Mixing insert with traversal methods

2. Which of the following is the correct syntax to insert a value val into a BST using a recursive function in C++?

easy

A. root = insert(root, val);

B. insert(root, val);

C. root.insert(val);

D. insert(val, root);

Solution

1. Step 1: Understand recursive insert signature

   Recursive insert usually returns the new root after insertion, so assignment like root = insert(root, val); is needed.

2. Step 2: Check other options

   Calling insert(root, val); without assignment ignores updated root. root.insert(val); assumes method on node object which is uncommon. insert(val, root); has wrong parameter order.

3. Final Answer:

   root = insert(root, val); -> Option A

4. Quick Check:

   Assign returned root after insert [OK]

Hint: Assign root = insert(root, val) for recursive insertion [OK]

Common Mistakes:

• Not assigning the returned root after insertion
• Using wrong parameter order in insert call
• Assuming insert is a method of node object

3. Consider the following C++ code inserting values into an empty BST:

struct Node {
  int data;
  Node* left;
  Node* right;
  Node(int val) : data(val), left(nullptr), right(nullptr) {}
};

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

int main() {
  Node* root = nullptr;
  root = insert(root, 10);
  root = insert(root, 5);
  root = insert(root, 15);
  root = insert(root, 12);
  return 0;
}

What is the structure of the BST after these insertions?

medium

A. 10 -> 5 -> 12 (left), 10 -> 15 -> null (right subtree)

B. 10 -> 15 -> null (left), 10 -> 5 -> 12 (right subtree)

C. 10 -> 12 -> 5 (left), 10 -> 15 -> null (right subtree)

D. 10 -> 5 -> null (left), 10 -> 15 -> 12 (right subtree)

Solution

1. Step 1: Insert 10, 5, 15, 12 step-by-step

   Start with empty root. Insert 10 as root. Insert 5 goes left of 10. Insert 15 goes right of 10. Insert 12 goes left of 15.

2. Step 2: Visualize BST structure

   Root 10 has left child 5 (no children), right child 15 with left child 12 (no right child).

3. Final Answer:

   10 -> 5 -> null (left), 10 -> 15 -> 12 (right subtree) -> Option D

4. Quick Check:

   Insert order builds left 5, right 15 with left 12 [OK]

Hint: Insert smaller left, larger right; 12 is left child of 15 [OK]

Common Mistakes:

• Placing 12 as right child of 15 instead of left
• Swapping left and right children of 10
• Ignoring null children in output

4. The following code attempts to insert a value into a BST but causes a runtime error:

Node* insert(Node* root, int val) {
  if (root == nullptr) {
    Node* newNode = new Node(val);
  }
  if (val < root->data) {
    root->left = insert(root->left, val);
  } else {
    root->right = insert(root->right, val);
  }
  return root;
}

What is the error and how to fix it?

medium

A. Missing return after creating new node; add return newNode;

B. Incorrect comparison operator; use <= instead of <

C. Should not assign to root->left or root->right

D. Node constructor is missing initialization

Solution

1. Step 1: Identify missing return in base case

   When root is nullptr, new node is created but not returned, so function continues and dereferences nullptr causing runtime error.

2. Step 2: Fix by returning new node immediately

   Add return newNode; inside the if block to return the newly created node and stop further execution.

3. Final Answer:

   Missing return after creating new node; add return newNode; -> Option A

4. Quick Check:

   Return new node on nullptr base case [OK]

Hint: Always return new node immediately when root is nullptr [OK]

Common Mistakes:

• Not returning new node causes nullptr dereference
• Changing comparison operator unnecessarily
• Misunderstanding pointer assignments

5. You have a BST with nodes 20, 10, 30, 25, 40. You want to insert 15 and 35. After insertion, which of the following is the correct in-order traversal of the BST?

hard

A. [15, 10, 20, 25, 30, 35, 40]

B. [10, 15, 20, 25, 30, 35, 40]

C. [10, 20, 15, 25, 30, 35, 40]

D. [10, 15, 20, 30, 25, 35, 40]

Solution

1. Step 1: Insert 15 and 35 into BST

   Insert 15: less than 20, greater than 10, goes right of 10. Insert 35: less than 40, greater than 30, goes right of 30.

2. Step 2: Perform in-order traversal

   In-order traversal visits nodes in ascending order: left subtree, root, right subtree. The order is 10, 15, 20, 25, 30, 35, 40.

3. Final Answer:

   [10, 15, 20, 25, 30, 35, 40] -> Option B

4. Quick Check:

   In-order traversal = sorted nodes [OK]

Hint: In-order traversal of BST is sorted list [OK]

Common Mistakes:

• Placing 15 or 35 in wrong subtree
• Confusing traversal order
• Listing nodes unsorted in output