Implement an in-order BST iterator that supports `next()` and `hasNext()` operations in $O(1)$ average time and $O(h)$ space, where $h$ is the height of the tree.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.