Find Triplet with Sum 0 in a BST
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.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late January, 2025
Junior
Find triplet with sum 0 in a BST
Hello Interview Premium
Your account is free and you can post anonymously if you choose.