# 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: TreeNode):
self.stack = []
while root:
self.stack.append(root)
root = root.left
def next(self) -> int:
if not self.stack:
return None
node = self.stack.pop()
curt = node.right
while curt:
self.stack.append(curt)
curt = curt.left
return node.val
def hasNext(self) -> bool:
return len(self.stack) > 0
# Your BSTIterator object will be instantiated and called as such:
# obj = BSTIterator(root)
# param_1 = obj.next()
# param_2 = obj.hasNext()
[Leetcode] 173. Binary Search Tree Iterator
最新推荐文章于 2024-09-15 15:29:37 发布