Knowledge Guide
Home › DSA › Recursion

10 Inserting a new node in a BST

Problem Statement

Write Recursive Approach to Insert New Node in a Binary Search Tree.

Given a binary search tree (BST) and a value to be inserted, write a recursive algorithm to insert a new node with the given value into the BST while maintaining its properties.

Examples

  1. BST Before Insertion:

        4
   / \
  2   7
 / \
1   3

    Input Node: 5 Output BST:

         4
   /    \
  2      7
 / \    /  
1   3  5

    Explanation: The input node with value 5 is inserted as the left child of node 7.

  2. BST Before Insertion:

        6
   / \
  3   8
 / \   \
1   5   9

    Input Node: 4 Output BST:

        6
   / \
  3   8
 / \   \
1   5   9
   /
  4

    Explanation: The input node with value 4 is inserted as the left child of node 5.

  3. BST Before Insertion: Empty BST (null)
    Input Node: 2
    Output BST:

       2

    Explanation: The input node with value 2 becomes the root of the BST.

Constraints:

Try it yourself

Try solving this question here:

🤖 Don't fully get this? Learn it with Claude

Stuck on 10 Inserting a new node in a BST? Open Claude, copy a block below, and it'll teach you this exact concept — visually and interactively.

🎨 Explain it visually

Build the mental picture, not memorization.

I just read a lesson on **10 Inserting a new node in a BST** (DSA) and want to truly understand it. Explain 10 Inserting a new node in a BST from first principles using ONE vivid real-world analogy and a visual mental model — draw it as ASCII art or a clear step-by-step diagram — with a concrete example using real numbers. Then ask me one question to check I got the mental picture, and wait for my reply. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🤔 Walk me through it (interactive)

Socratic — adapts to where you're stuck.

Teach me **10 Inserting a new node in a BST** interactively. Ask me ONE guiding question at a time, wait for my answer, and adapt to my confusion — build the idea with me step by step instead of explaining it all at once. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🧪 Quiz me & fix my gaps

Active recall exposes what you missed.

Quiz me on **10 Inserting a new node in a BST** with 5 questions, easy to tricky, ONE at a time. Tell me if each answer is right; at the end, explain clearly what I got wrong and why. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🧠 Make it stick

Intuition + hook + flashcards for long-term memory.

Help me remember **10 Inserting a new node in a BST** for the long term: give the one-sentence intuition, a memorable hook/mnemonic, a tiny worked example, and 3 active-recall flashcards (Q -> A). If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.

📝 My notes

← 9 Binary Search11 BST Inorder Traversal →