Why BST Inorder Successor in DSA Typescript?

The Big Idea

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

The Scenario

Imagine you have a family tree drawn on paper, and you want to find the next person in age order after a certain family member. Doing this by scanning the whole tree every time is tiring and confusing.

The Problem

Manually searching for the next person means checking many names one by one, which takes a lot of time and can easily lead to mistakes or missing someone.

The Solution

The BST Inorder Successor helps you quickly find the next bigger value in a sorted tree without checking everything. It uses the tree's order to jump straight to the answer.

Before vs After

✗ Before

function findNextValue(node) {
  // scan all nodes, sort them, then find next
  let values = [];
  traverseTree(root, values);
  values.sort((a, b) => a - b);
  let index = values.indexOf(node.value);
  return values[index + 1] || null;
}

✓ After

function findInorderSuccessor(node) {
  if (node.right) {
    return findMin(node.right);
  }
  let successor = null;
  let ancestor = root;
  while (ancestor !== node) {
    if (node.value < ancestor.value) {
      successor = ancestor;
      ancestor = ancestor.left;
    } else {
      ancestor = ancestor.right;
    }
  }
  return successor;
}

What It Enables

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

Real Life Example

In a contact list sorted by names, finding the next contact after "John" without scanning the whole list helps you jump quickly to the right person.

Key Takeaways

Manual searching is slow and error-prone.

BST Inorder Successor uses tree order to find the next bigger value fast.

This makes searching and ordering efficient in sorted data.

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 with a key greater than the current node.

3. Final Answer:

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

4. Quick Check:

   Inorder successor = next bigger node [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 TypeScript function signatures correctly represents a function to find the inorder successor in a BST node?

easy

A. function inorderSuccessor(root: TreeNode | null, p: TreeNode): TreeNode | null

B. function inorderSuccessor(p: TreeNode): TreeNode

C. function inorderSuccessor(root: TreeNode): void

D. function inorderSuccessor(root: TreeNode, p: TreeNode): number

Solution

1. Step 1: Analyze parameters needed

   To find inorder successor, we need the BST root and the target node p.

2. Step 2: Analyze return type

   The function returns the successor node or null if none exists.

3. Final Answer:

   function inorderSuccessor(root: TreeNode | null, p: TreeNode): TreeNode | null -> Option A

4. Quick Check:

   Correct params and return type [OK]

Hint: Successor function needs root and target node, returns node or null [OK]

Common Mistakes:

• Missing root parameter
• Wrong return type (void or number)
• Not allowing null root

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

      6
     / \
    2   8
   / \   \
  0   4   9
     / \
    3   5

medium

A. Node with value 8

B. Node with value 6

C. Node with value 4

D. Node with value 9

Solution

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

   Node 5 has no right child, so successor is one of its ancestors.

2. Step 2: Find lowest ancestor whose left child is ancestor of node 5

   Node 6 is the first ancestor where node 5 is in left subtree, so successor is node 6.

3. Final Answer:

   Node with value 6 -> Option B

4. Quick Check:

   Successor of 5 is 6 [OK]

Hint: If no right child, go up to first bigger ancestor [OK]

Common Mistakes:

• Choosing right child of root instead of ancestor
• Picking node 8 which is too big
• Confusing predecessor with successor

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

function inorderSuccessor(root: TreeNode | null, p: TreeNode): TreeNode | null {
  let successor: TreeNode | null = null;
  while (root) {
    if (p.val < root.val) {
      successor = root;
      root = root.left;
    } else {
      if (p.val === root.val) {
        return successor;
      }
      root = root.right;
    }
  }
  return successor;
}

What is the bug in this code?

medium

A. It may cause infinite loop if root is null

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

C. It does not handle the case when node p has a right subtree

D. It returns the predecessor instead of successor

Solution

1. Step 1: Understand code logic

   The code moves down the tree to find the smallest node greater than p.val, updating successor accordingly.

2. Step 2: Identify missing case

   If p has a right subtree, the successor is the leftmost node in that subtree, but this code ignores that and only searches from root.

3. Final Answer:

   It does not handle the case when node p has a right subtree -> Option C

4. Quick Check:

   Right subtree check missing [OK]

Hint: Check right subtree first for successor [OK]

Common Mistakes:

• Ignoring right subtree of p
• Assuming successor always in ancestors
• Confusing successor with predecessor

5. You have a BST and want to find the inorder successor of a node p. The node p has a right child. Which of the following is the correct approach to find the inorder successor?

hard

A. Return the root of the BST

B. Return the rightmost node in p's left subtree

C. Return the parent of p

D. Return the leftmost node in p's right subtree

Solution

1. Step 1: Check if p has right subtree

   If p has a right child, the inorder successor is the smallest node in that right subtree.

2. Step 2: Find leftmost node in right subtree

   Traverse left children starting from p's right child until no more left child exists.

3. Final Answer:

   Return the leftmost node in p's right subtree -> Option D

4. Quick Check:

   Successor in right subtree's leftmost node [OK]

Hint: Successor with right child = leftmost node in right subtree [OK]

Common Mistakes:

• Returning parent instead of leftmost right subtree node
• Returning rightmost left subtree node
• Returning root regardless of p