← Questions
Binary search tree iterator
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding