Implement an iterator for the BinarySearchTree class that visits the nodes in sorted order. In the constructor,

Question:

Implement an iterator for the BinarySearchTree class that visits the nodes in sorted order. In the constructor, keep pushing left nodes on a stack until you reach null. In each call to next, deliver the top of the stack as the visited node, but first push the left nodes in its right subtree.

image text in transcribed