Available question text
Given a Binary Search Tree (BST), find if there exists a triplet of nodes such that their values sum up to zero. Return true if such a triplet exists, otherwise return false.
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
Amazon
Find Triplet with Sum 0 in a BST
Reported Jan 25, 2025 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source