Find Sum Pair, is a BST related problem and in this post we will see how we can solve this challenge in C++

Given a key ,check whether there exists any pair whose sum is equal to the key Start traversal both from leftmost of inorder traversal and rightmost of it After each node check whether the sum of nodes is equal to the key or not do just like the array ques. if not equal

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas