中序遍历的迭代法：173. 二叉搜索树迭代器

题目链接：173. 二叉搜索树迭代器

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class BSTIterator:

    def __init__(self, root: TreeNode):
        self.stack = []
        self.midOrder(root)

    def midOrder(self,root):
        while root:
            self.stack.append(root)
            root = root.left

    def next(self) -> int:
        """
        @return the next smallest number
        """
        cur = self.stack.pop()
        if cur.right:
            self.midOrder(cur.right)
        return cur.val


    def hasNext(self) -> bool:
        """
        @return whether we have a next smallest number
        """
        return len(self.stack)>=1


# Your BSTIterator object will be instantiated and called as such:
# obj = BSTIterator(root)
# param_1 = obj.next()
# param_2 = obj.hasNext()

 总结：利用二叉搜索树的中序遍历迭代法进行模拟。