Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
next() will return the next smallest number in the BST.
hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
Special thanks to @ts for adding this problem and creating all test cases.