Leetcode-173 二叉搜索树迭代器

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

    def __init__(self, root):
        """
        :type root: TreeNode
        """
        self.inorder_stack = deque([])

        stack = []
        while root or stack:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            self.inorder_stack.append(root.val)
            root = root.right

    def next(self):
        """
        :rtype: int
        """
        return self.inorder_stack.popleft()
        

    def hasNext(self):
        """
        :rtype: bool
        """
        return True if self.inorder_stack else False




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