Tag Archives: minimum space complexity to find if there exists a triplet in a binary search tree that adds up to zero

Triplets in a Binary Search Tree that sum to zero

Triplets in a Binary Search Tree that sum to zero. Problem statement to find three numbers in a binary search tree that sum to zero: Given a balanced binary search tree (BST), determine if there exist three numbers that add up to zero.If they exist, output YES. Example for testing if 3 numbers in a BST… Read More »