# Two Sum IV Input Is A BST: Walkthrough

Two Sum IV Input Is A BST shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Inorder into a sorted list then two-pointer, or a hash-set DFS: if k-node.val was seen return true, else add node.val and recurse.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Assuming the two nodes must be a parent and child.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.