Two Sum IV - Input is a BST

Problem Given the root of a binary search tree and an integer k, return true if there exist two elements in the BST such that their sum is equal to k, or false otherwise. (link) Example 1: Input: root = [5,3,6,2,4,null,7], k = 9 Output: true Examp...