BST Delete Operation in DSA C# - Time & Space Complexity

Time Complexity: BST Delete Operation

O(h)

Understanding Time Complexity

We want to understand how long it takes to remove a value from a Binary Search Tree (BST).

How does the time needed change as the tree grows bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public TreeNode DeleteNode(TreeNode root, int key) {
    if (root == null) return null;
    if (key < root.val) {
        root.left = DeleteNode(root.left, key);
    } else if (key > root.val) {
        root.right = DeleteNode(root.right, key);
    } else {
        if (root.left == null) return root.right;
        if (root.right == null) return root.left;
        TreeNode minNode = FindMin(root.right);
        root.val = minNode.val;
        root.right = DeleteNode(root.right, minNode.val);
    }
    return root;
}

private TreeNode FindMin(TreeNode node) {
    while (node.left != null) node = node.left;
    return node;
}
    

This code removes a node with a given key from a BST, adjusting the tree to keep its order.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls to find the node to delete and to adjust the tree.
• How many times: At most once per tree level, moving down from root to leaf.
• Additional operation: Finding the minimum node in the right subtree, which is a simple loop down the left children.

How Execution Grows With Input

As the tree grows taller, the number of steps to find and delete a node grows roughly with the height.

Input Size (n)	Approx. Operations
10	Up to 4-5 steps (tree height about 3-4)
100	Up to 7-8 steps (tree height about 7)
1000	Up to 10-11 steps (tree height about 10)

Pattern observation: The steps grow slowly as the tree grows, roughly proportional to the tree height.

Final Time Complexity

Time Complexity: O(h)

This means the time to delete depends on the height of the tree, not the total number of nodes.

Common Mistake

[X] Wrong: "Deleting a node always takes the same time regardless of tree shape."

[OK] Correct: If the tree is unbalanced and tall, deletion can take longer because we must travel down many levels.

Interview Connect

Understanding how tree height affects deletion time helps you explain efficiency clearly and shows you know how data structure shape matters.

Self-Check

"What if the BST is always perfectly balanced? How would the time complexity change then?"

Practice

1. What happens when you delete a leaf node (a node with no children) from a Binary Search Tree (BST)?

easy

A. The node is replaced by its right child.

B. The entire tree is restructured from the root.

C. The node is replaced by its left child.

D. The node is simply removed without affecting other nodes.

Solution

1. Step 1: Understand leaf node deletion

   A leaf node has no children, so removing it does not affect other nodes.

2. Step 2: Effect on BST structure

   Since no children exist, no restructuring is needed; just remove the node.

3. Final Answer:

   The node is simply removed without affecting other nodes. -> Option D

4. Quick Check:

   Leaf node deletion = simple removal [OK]

Hint: Leaf nodes delete by direct removal only [OK]

Common Mistakes:

• Thinking the tree restructures after leaf deletion
• Replacing leaf node with a child that doesn't exist
• Confusing leaf node deletion with internal node deletion

2. Which of the following is the correct C# syntax to delete a node with value 10 from a BST using a method named DeleteNode?

easy

A. root.DeleteNode(10);

B. root = DeleteNode(root, 10);

C. DeleteNode(root, 10);

D. DeleteNode(10, root);

Solution

1. Step 1: Understand method signature

   Usually, BST delete methods return the new root after deletion, so assignment is needed.

2. Step 2: Correct method call syntax

   Calling DeleteNode(root, 10) returns updated root, so root = DeleteNode(root, 10); is correct.

3. Final Answer:

   root = DeleteNode(root, 10); -> Option B

4. Quick Check:

   Assign returned root after deletion [OK]

Hint: Assign returned root after delete call [OK]

Common Mistakes:

• Not assigning the returned root after deletion
• Calling delete as instance method on root node
• Passing arguments in wrong order

3. Given the BST below and the C# code to delete node 15, what is the in-order traversal output after deletion?

      20
     /  \
   10    30
     
     15

root = DeleteNode(root, 15);

medium

A. [10, 20, 30]

B. [10, 15, 20, 30]

C. [20, 30]

D. [10, 20, 15, 30]

Solution

1. Step 1: Identify node to delete and its position

   Node 15 is a leaf node (no children) under 10.

2. Step 2: Delete node 15 and perform in-order traversal

   After deleting 15, in-order traversal visits nodes in ascending order: 10, 20, 30.

3. Final Answer:

   [10, 20, 30] -> Option A

4. Quick Check:

   In-order after deleting leaf = sorted without deleted node [OK]

Hint: In-order skips deleted leaf node [OK]

Common Mistakes:

• Including deleted node in traversal output
• Misordering nodes in traversal
• Confusing pre-order or post-order with in-order

4. Consider this C# method snippet for deleting a node from a BST:

Node DeleteNode(Node root, int key) {
  if (root == null) return root;
  if (key < root.val) root.left = DeleteNode(root.left, key);
  else if (key > root.val) root.right = DeleteNode(root.right, key);
  else {
    if (root.left == null) return root.right;
    else if (root.right == null) return root.left;
    root.val = MinValue(root.right);
    root.right = DeleteNode(root.right, root.val);
  }
  return root;
}

What is the bug in this code?

medium

A. The method does not update root.left or root.right after recursive calls.

B. The method does not handle the case when both children exist properly.

C. The method does not handle deleting leaf nodes correctly.

D. The method does not return the updated root after deletion.

Solution

1. Step 1: Analyze deletion when both children exist

   The method correctly replaces root's value with the minimum in the right subtree and deletes that minimum node recursively.

2. Step 2: Check correctness of recursive updates

   The method updates root.left and root.right after recursive calls, so this is handled properly.

3. Step 3: Identify the actual bug

   There is no bug in handling both children case or returning root; the code is correct.

4. Final Answer:

   None of the provided options correctly identify a bug. -> Option A

Hint: Check both children case carefully [OK]

Common Mistakes:

• Thinking leaf deletion is buggy here
• Missing recursive update of child pointers
• Assuming method forgets to return root

5. You have a BST with nodes: 50, 30, 70, 20, 40, 60, 80. You delete node 50 (the root). Which node replaces the root to maintain BST properties?

hard

A. Node 30 (left child of root)

B. Node 40 (maximum in left subtree)

C. Node 60 (minimum in right subtree)

D. Node 70 (right child of root)

Solution

1. Step 1: Identify node to delete and its children

   Node 50 is root with two children: left subtree (30, 20, 40) and right subtree (70, 60, 80).

2. Step 2: Find replacement node for root deletion

   Standard BST deletion replaces node with minimum node in right subtree, which is 60.

3. Final Answer:

   Node 60 (minimum in right subtree) -> Option C

4. Quick Check:

   Root replaced by min right subtree node [OK]

Hint: Replace deleted node with min right subtree node [OK]

Common Mistakes:

• Replacing with max left subtree instead of min right
• Replacing with immediate child without checking subtree
• Confusing replacement rules for BST deletion