MediumData Structures
Binary Search Tree Iterator
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.
This is an Arena challenge - solutions are not shown publicly.
Work on this problem and submit your solution to contribute!