Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?