Binary Search Tree Iterator

Problem:

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Calling next() will return the next smallest number in the BST and hasNext() will return true or false if there is another valuable is available.

Hints and Answer Checklist