Available question text
Given two binary search trees and a target integer, determine whether there exists one node from each tree whose values sum to the target. Leverage BST ordering to avoid brute-force pairing (e.g., use lookups or synchronized in-order / reverse in-order traversals to achieve near-linear time with low extra space).
Related questions
Continue with questions that share topics or the same question type.
- Convert Integer to the Sum of Two No-Zero Integers
Coding
- Find Two Non-overlapping Sub-arrays Each With Target Sum
Coding
- Maximum Sum of Two Non-Overlapping Subarrays
Coding · Array · Dynamic Programming · Sliding Window
- Minimize Product Sum of Two Arrays
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1214. Two Sum BSTs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source