DIY: Binary Search Tree Iterator
Understand how to implement a BSTIterator class that allows in-order traversal of a binary search tree using next() and hasNext() methods. This lesson helps you practice key data structure manipulation for coding interviews by iterating over BST nodes efficiently.
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