DIY: Binary Search Tree Iterator
Explore how to implement a Binary Search Tree iterator with next and hasNext methods. Understand how to traverse a BST efficiently by returning the next smallest element and checking if more elements exist, preparing for real coding interview scenarios.
We'll cover the following...
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.