Binary Search Tree Iterator
Problem Statement
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next()
will return the next smallest number in the BST.
These were the top 10 stories published by Algorithm Problems in 2016. You can also dive into monthly archives for 2016 by using the calendar at the top of this page.