Binary search tree iterator

Implement an iterator over a binary search tree that returns the values in ascending order with next() and has_next(). Each call should take amortised O(1) time, and memory should be O(height).