Find the sum of pairs in a binary search tree equal to k.

• Traverse the tree in-order and store the values in an array.

• Use two pointers approach to find the pairs that sum up to k.

• Time complexity: O(n),...read more