Available question text
Given the root of a binary search tree and an integer k, determine whether there exist two distinct nodes whose values sum to k, leveraging the BST property for an efficient pair search.
Related questions
Continue with questions that share topics or the same question type.
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 653. Two Sum IV - Input is a BST
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source