Solve the two sum problem in BST. Implement an InorderIterator for BST and an ReverseInorderIterator for BST, so that a BST can be iterated sequentially like a list, and the two sum problem in BST can be converted into the two sum problem for a sorted linked list, which can be solved in O(n) by searching from both ends.