DIY: Binary Search Tree Iterator

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