Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Scala: Real-World Examples

DIY: Binary Search Tree Iterator

Build a BSTIterator class that navigates a binary search tree by returning the next smallest element. Learn to implement next and hasNext functions efficiently, enhancing your problem-solving skills for coding interviews.

We'll cover the following...

Problem statement

In this challenge, you have to implement a binary search tree iterator class called BSTIterator. The iterator will be initialized by the root node of the BST. You have to implement two methods:

  • next(): This will return the next smallest number in the BST.
...