Two Sum in BST in DSA Typescript - Practice Problems & Challenges

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Two Sum in BST with target 9

Given the BST and target = 9, what is the output of the Two Sum function that returns true if two nodes sum to the target?

DSA Typescript

class TreeNode {
  val: number;
  left: TreeNode | null;
  right: TreeNode | null;
  constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
    this.val = val === undefined ? 0 : val;
    this.left = left === undefined ? null : left;
    this.right = right === undefined ? null : right;
  }
}

function findTarget(root: TreeNode | null, k: number): boolean {
  const set = new Set<number>();
  function dfs(node: TreeNode | null): boolean {
    if (!node) return false;
    if (set.has(k - node.val)) return true;
    set.add(node.val);
    return dfs(node.left) || dfs(node.right);
  }
  return dfs(root);
}

// BST:
//       5
//      / \
//     3   6
//    / \   \
//   2   4   7

const root = new TreeNode(5,
  new TreeNode(3,
    new TreeNode(2),
    new TreeNode(4)
  ),
  new TreeNode(6,null,new TreeNode(7))
);

console.log(findTarget(root, 9));

A true

B false

C undefined

D TypeError

💡 Hint

Think about checking if the complement (target - current node value) exists in a set while traversing.

The function traverses the BST and stores visited node values in a set. When it finds a node where target - node.val is already in the set, it returns true. Here, 2 and 7 sum to 9, so output is true.

🧠 Conceptual

intermediate

What data structure is best for checking complements in Two Sum in BST?

In the Two Sum problem on a BST, which data structure allows efficient checking if the complement (target - current node value) has been seen before?

A Array

B Queue

C Stack

D Set

💡 Hint

You want fast lookup to check if a value exists.

A Set provides O(1) average time complexity for lookup, making it ideal to check if the complement exists while traversing the BST.

🔧 Debug

advanced

Identify the error in this Two Sum in BST code snippet

What error will this TypeScript code produce when run?

DSA Typescript

function findTarget(root: TreeNode | null, k: number): boolean {
  const set = new Set<number>();
  function dfs(node: TreeNode | null): boolean {
    if (!node) return false;
    if (set.has(k - node.val)) return true;
    set.add(node.val);
    return dfs(node.left) && dfs(node.right);
  }
  return dfs(root);
}

A Always returns false

B Returns true only if both left and right subtrees have pairs summing to k

C Returns true if two nodes sum to k

D Throws a runtime error

💡 Hint

Check the logical operator used to combine recursive calls.

Using && means both left and right subtree calls must be true to return true, which is incorrect. It should be || to return true if either subtree has a valid pair.

❓ Predict Output

advanced

Output of Two Sum in BST with target 28

Given the BST below and target = 28, what is the output of the Two Sum function?

DSA Typescript

class TreeNode {
  val: number;
  left: TreeNode | null;
  right: TreeNode | null;
  constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
    this.val = val === undefined ? 0 : val;
    this.left = left === undefined ? null : left;
    this.right = right === undefined ? null : right;
  }
}

function findTarget(root: TreeNode | null, k: number): boolean {
  const set = new Set<number>();
  function dfs(node: TreeNode | null): boolean {
    if (!node) return false;
    if (set.has(k - node.val)) return true;
    set.add(node.val);
    return dfs(node.left) || dfs(node.right);
  }
  return dfs(root);
}

// BST:
//       10
//      /  \
//     5    15
//    / \     \
//   3   7     18

const root = new TreeNode(10,
  new TreeNode(5,
    new TreeNode(3),
    new TreeNode(7)
  ),
  new TreeNode(15,null,new TreeNode(18))
);

console.log(findTarget(root, 28));

A true

B TypeError

C undefined

D false

💡 Hint

Check if any two nodes sum to 28.

The function traverses the BST and stores visited node values in a set. When it finds a node where target - node.val is already in the set, it returns true. Here, 10 and 18 sum to 28, so output is true.

🧠 Conceptual

expert

Time complexity of Two Sum in BST using DFS and Set

What is the time complexity of the Two Sum in BST algorithm that uses DFS traversal and a Set to check complements?

A O(n^2)

B O(n log n)

C O(n)

D O(log n)

💡 Hint

Consider that each node is visited once and set lookups are O(1).

The algorithm visits each node once (O(n)) and performs O(1) lookup in the set, so total time is O(n).

Practice

1. What is the main goal of the Two Sum in BST problem?

easy

A. Check if a BST is balanced

B. Find two nodes in a BST whose values add up to a target sum

C. Count the number of nodes in a BST

D. Find the maximum value in a BST

Solution

1. Step 1: Understand the problem statement

   The problem asks to find two nodes in a Binary Search Tree (BST) such that their values add up to a given target sum.

2. Step 2: Identify the goal

   The goal is to check if such a pair exists, not to find maximum, count nodes, or check balance.

3. Final Answer:

   Find two nodes in a BST whose values add up to a target sum -> Option B

4. Quick Check:

   Two Sum in BST = Find pair with target sum [OK]

Hint: Look for two values adding to target in BST [OK]

Common Mistakes:

• Confusing with finding max or min value
• Thinking it counts nodes instead of finding pairs
• Assuming it checks tree balance

2. Which TypeScript syntax correctly defines a BST node for the Two Sum problem?

easy

A. interface TreeNode { val: string; left: TreeNode; right: TreeNode; }

B. function TreeNode(val) { this.val = val; this.left = null; this.right = null; }

C. type TreeNode = { val: number; left?: TreeNode; right?: TreeNode; }

D. class TreeNode { val: number; left: TreeNode | null; right: TreeNode | null; constructor(val: number) { this.val = val; this.left = null; this.right = null; } }

Solution

1. Step 1: Check correct TypeScript class syntax for BST node

   class TreeNode { val: number; left: TreeNode | null; right: TreeNode | null; constructor(val: number) { this.val = val; this.left = null; this.right = null; } } defines a class with number value and nullable left/right children, matching BST node structure.

2. Step 2: Compare other options

   function TreeNode(val) { this.val = val; this.left = null; this.right = null; } is JavaScript function style, not TypeScript class. interface TreeNode { val: string; left: TreeNode; right: TreeNode; } uses string type for val and non-nullable children, which is incorrect. type TreeNode = { val: number; left?: TreeNode; right?: TreeNode; } uses optional properties but lacks constructor and proper null handling.

3. Final Answer:

   class TreeNode { val: number; left: TreeNode | null; right: TreeNode | null; constructor(val: number) { this.val = val; this.left = null; this.right = null; } } -> Option D

4. Quick Check:

   Correct BST node class syntax = class TreeNode { val: number; left: TreeNode | null; right: TreeNode | null; constructor(val: number) { this.val = val; this.left = null; this.right = null; } } [OK]

Hint: Use class with nullable left/right and number val [OK]

Common Mistakes:

• Using string type for node value
• Not initializing left and right to null
• Using JavaScript function instead of TypeScript class

3. Given the BST below and target = 9, what will the Two Sum function return?

    5
   / \
  3   7
 /     \
2       8

Function uses in-order traversal and a set to find pairs.

medium

A. true

B. false

C. null

D. Error

Solution

1. Step 1: Traverse BST in-order and check pairs

   In-order traversal gives sorted values: [2, 3, 5, 7, 8]. We check if target - current value exists in set.

2. Step 2: Find pair summing to 9

   Check pairs: 2 + 7 = 9 (found), so function returns true.

3. Final Answer:

   true -> Option A

4. Quick Check:

   2 + 7 = 9 found in BST [OK]

Hint: In-order traversal gives sorted list to find pairs [OK]

Common Mistakes:

• Assuming no pair without checking all nodes
• Confusing traversal order
• Ignoring set lookup for complements

4. Identify the bug in this TypeScript Two Sum in BST function snippet:

function findTarget(root: TreeNode | null, k: number): boolean {
  const set = new Set<number>();
  function dfs(node: TreeNode | null): boolean {
    if (!node) return false;
    if (set.has(k - node.val)) return true;
    set.add(node.val);
    dfs(node.left);
    dfs(node.right);
    return false;
  }
  return dfs(root);
}

medium

A. The base case should return true when node is null

B. Set is not initialized properly

C. The function returns false too early, missing true from recursive calls

D. The function should use a queue instead of recursion

Solution

1. Step 1: Analyze recursive calls and return values

   The dfs function calls dfs(node.left) and dfs(node.right) but ignores their return values, always returning false at the end.

2. Step 2: Identify missing return propagation

   If dfs(node.left) or dfs(node.right) returns true, dfs should return true immediately to propagate the success.

3. Final Answer:

   The function returns false too early, missing true from recursive calls -> Option C

4. Quick Check:

   Return recursive true results to avoid missing pairs [OK]

Hint: Return recursive calls' results to propagate true [OK]

Common Mistakes:

• Ignoring return values of recursive calls
• Returning false before checking all nodes
• Misunderstanding base case return

5. You want to optimize Two Sum in BST for large trees. Which approach best reduces time complexity while using O(h) space, where h is tree height?

hard

A. Use two pointers with iterative in-order and reverse in-order traversals simultaneously

B. Convert BST to array and use nested loops to find pairs

C. Use breadth-first search with a hash set to find pairs

D. Perform recursive DFS and store all node values in a list before checking pairs

Solution

1. Step 1: Understand space and time constraints

   We want to reduce time complexity and keep space to O(h), where h is tree height.

2. Step 2: Evaluate approaches

   Use two pointers with iterative in-order and reverse in-order traversals simultaneously uses two pointers with iterative in-order (smallest to largest) and reverse in-order (largest to smallest) traversals, allowing pair search in O(n) time and O(h) space. Other options use extra space O(n) or nested loops with O(n^2) time.

3. Final Answer:

   Use two pointers with iterative in-order and reverse in-order traversals simultaneously -> Option A

4. Quick Check:

   Two pointer BST traversal = O(n) time, O(h) space [OK]

Hint: Use two pointers with in-order and reverse in-order iterators [OK]

Common Mistakes:

• Using nested loops causing O(n^2) time
• Storing all nodes in list increasing space to O(n)
• Using BFS which uses more space than O(h)