Why BST Inorder Successor in DSA Java?

The Big Idea

What if you could jump directly to the next item in a sorted list without checking everything?

The Scenario

Imagine you have a family tree drawn on paper, and you want to find the next person in order after a given family member. Doing this by scanning the whole tree manually is confusing and slow.

The Problem

Manually searching for the next person means checking every node, remembering where you are, and guessing the order. This is slow and easy to make mistakes, especially in big trees.

The Solution

The BST Inorder Successor method gives a clear, step-by-step way to find the next node in order without checking the whole tree. It uses the tree's structure to jump directly to the right answer.

Before vs After

✗ Before

Node current = root;
while (current != null) {
  // guess and check all nodes
  if (current.value > target) {
    // maybe this is successor
  }
  current = current.left != null ? current.left : current.right;
}

✓ After

Node successor = null;
Node current = root;
while (current != null) {
  if (current.value > target) {
    successor = current;
    current = current.left;
  } else {
    current = current.right;
  }
}

What It Enables

This lets you quickly find the next bigger value in a sorted tree, making searching and ordering tasks much faster and easier.

Real Life Example

When you browse a sorted list of contacts on your phone and want to jump to the next contact alphabetically, the phone uses a similar idea to find the next name quickly.

Key Takeaways

Manual search in trees is slow and error-prone.

BST Inorder Successor uses tree properties to find the next node efficiently.

This method speeds up ordered data retrieval and navigation.

Practice

1. What is the inorder successor of a node in a Binary Search Tree (BST)?

easy

A. The node with the smallest key greater than the given node's key

B. The node with the largest key smaller than the given node's key

C. The root node of the BST

D. The left child of the given node

Solution

1. Step 1: Understand inorder traversal order

   Inorder traversal visits nodes in ascending order of their keys in a BST.

2. Step 2: Define inorder successor

   The inorder successor of a node is the next node visited after it in inorder traversal, which is the smallest node greater than it.

3. Final Answer:

   The node with the smallest key greater than the given node's key -> Option A

4. Quick Check:

   Inorder successor = smallest greater key [OK]

Hint: Inorder successor is next bigger node in sorted order [OK]

Common Mistakes:

• Confusing successor with predecessor
• Thinking successor is always right child
• Assuming successor is parent node

2. Which of the following Java method signatures correctly represents a function to find the inorder successor in a BST node class?

easy

A. public void inorderSuccessor(Node p)

B. public Node inorderSuccessor(Node root, Node p)

C. public int inorderSuccessor(Node root)

D. public Node inorderSuccessor(int key)

Solution

1. Step 1: Identify required inputs and outputs

   To find inorder successor, we need the BST root and the target node; output is the successor node.

2. Step 2: Match method signature

   public Node inorderSuccessor(Node root, Node p) takes root and node, returns Node, matching requirements.

3. Final Answer:

   public Node inorderSuccessor(Node root, Node p) -> Option B

4. Quick Check:

   Input root and node, output node [OK]

Hint: Method needs root and target node, returns successor node [OK]

Common Mistakes:

• Missing root parameter
• Returning int instead of Node
• Using void return type

3. Given the BST below and the node with value 15, what is the inorder successor?

       20
      /  \
    10    30
      \
      15

medium

A. 20

B. 15

C. 30

D. 10

Solution

1. Step 1: Locate node 15 and check right subtree

   Node 15 has no right child, so successor is ancestor with greater value.

2. Step 2: Find lowest ancestor greater than 15

   Ancestor 20 is the next bigger node after 15.

3. Final Answer:

   20 -> Option A

4. Quick Check:

   Next bigger after 15 is 20 [OK]

Hint: If no right child, successor is nearest bigger ancestor [OK]

Common Mistakes:

• Choosing 30 which is too big
• Choosing 10 which is smaller
• Choosing the node itself

4. Consider this buggy Java code snippet to find the inorder successor of a node in BST:

public Node inorderSuccessor(Node root, Node p) {
    if (p.right != null) {
        Node curr = p.right;
        while (curr.left != null) {
            curr = curr.left;
        }
        return curr;
    }
    Node succ = null;
    while (root != null) {
        if (p.val < root.val) {
            succ = root;
            root = root.left;
        } else {
            root = root.right;
        }
    }
    return succ;
}

What is the main bug in this code?

medium

A. It uses wrong comparison operator in while loop

B. It incorrectly updates successor when p.val >= root.val

C. It does not handle the case when p has no right child

D. It may return null even if successor exists

Solution

1. Step 1: Analyze right subtree handling

   If p has right child, code correctly finds leftmost node in right subtree.

2. Step 2: Analyze ancestor search loop

   Loop updates successor when p.val < root.val, else moves right. This is correct logic.

3. Step 3: Identify potential null return

   If p is the largest node, no successor exists, so null return is valid. Otherwise, code works.

4. Final Answer:

   It may return null even if successor exists -> Option D

5. Quick Check:

   Null return possible if logic misses successor [OK]

Hint: Check if successor can be missed when traversing ancestors [OK]

Common Mistakes:

• Assuming null means no successor always
• Ignoring right subtree case
• Misreading comparison operators

5. You have a BST and want to find the inorder successor of node with value 25. The BST is:

        40
       /  \
     20    60
    /  \  /  \
  10  30 50  70
       \
       25

Which node is the inorder successor of 25 and why?

hard

A. 30, because it is the smallest node greater than 25 in the right subtree

B. 50, because it is the leftmost node in the right subtree of 25

C. 40, because 25 has no right child and 40 is the nearest bigger ancestor

D. 20, because it is the parent of 25

Solution

1. Step 1: Check if node 25 has right child

   Node 25 has no right child, so successor is ancestor or next bigger node.

2. Step 2: Find nearest ancestor greater than 25

   Node 40 is the nearest ancestor greater than 25, so it is the inorder successor.

3. Final Answer:

   40, because 25 has no right child and 40 is the nearest bigger ancestor -> Option C

4. Quick Check:

   Next bigger node after 25 is 40 [OK]

Hint: Successor is leftmost node in right subtree or nearest bigger ancestor [OK]

Common Mistakes:

• Choosing 30 which is smaller than 25
• Choosing 50 which is too far
• Choosing parent 20 which is smaller