← Questions
Lazy in-order BST iterator
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Write an iterator over a binary search tree that returns values in sorted order one at a time, with next() and has_next(). Do it lazily with a stack, so memory is proportional to the tree's height, not its size. Follow-up: make the iterator safe when the tree is changed or the iterator is used from several threads at once.
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