use a stack to store all the current left nodes of the BST, when pop(), we * push all its right nodes into the stack if there are any. * This way, we use only O(h) memory for this iterator, this is a ...