## Find a Pair with the given sum in a BST

Problem Given a binary tree, the task is to find a pair with the given sum. The elements of the tree are pairwise distinct. Sample Input Sum = 11 Sample Output Pair is (4, 7) Approach We will use an unordered set to solve this problem. This is because an unordered set gives the time complexity of O(1)… Read More »