This is an example of a Binary Search Tree iterator that crawls the tree according to it's sort order.
When you can start a problem from a well defined corner, sometimes those problems become easier.
Write an example iterator that uses the last node emitted and add performance testing