Algorithm Design a Binary Search Tree Iterator Design a Binary Search Tree Iterator which allows us to retrieve the next smallest number and check if there exists the next smallest number in the BST.
