Microsoft Interview Question

Implement a BST Iterator: init(root): Initialize the BST Iterator with the root of the tree (TreeNode) getNext(): Return the smallest value (which wasn't returned so far) hasNext(): Return True if there are values you haven't returned yet, False otherwise