-->

Disclaimer: Here is the practice link to help you assess your knowledge better. It's highly recommend trying to solve it before looking at the solution.

Brute Force Approach

Algorithm

Perform an inorder traversal of the Binary Search Tree and store the nodes in an array, we obtain a sorted array.

Maintain a pointer or index variable to keep track of the current position within the array during iteration.

BSTIterator() initiailses this index to -1 and we access the elements in ascending order incrementing the index every time next() is called.

Dry Run