Design an iterator over a binary search tree (BST). Implement the BSTIterator class that represents an iterator over the in-order traversal of the BST. Example Input 7,3,15,null,null,9,20