173. Binary Search Tree Iterator刷题笔记

题目描述
一开始陷入思维局限，以为只能用递归做。其实大不了用栈来暴力做也挺好
还有一种是用Morris遍历，二刷的时候做
代码

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

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

    def pushLeft(self,node):
        while node:
            self.stack.append(node)
            node = node.left
        
    def next(self) -> int:
        result = self.stack.pop()
        self.pushLeft(result.right)
        return result.val

    def hasNext(self) -> bool:
        if self.stack:
            return True
        else:
            return False


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

结果：