Leetcode Problem 653. Two Sum IV - Input is a BST

653. Two Sum IV - Input is a BST

Leetcode Solutions

Initialize an empty HashSet seen.
Traverse the binary search tree using any traversal method (e.g., inorder, preorder, postorder).
For each node with value p, check if k - p is in seen.
- If k - p is found, return true.
- Otherwise, add p to seen.
If the traversal is complete and no pair is found, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen