# 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 Solution:
def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
# if not root:
# return []
# left = self.inorderTraversal(root.left)
# right = self.inorderTraversal(root.right)
# return left + [root.val] + right
if not root:
return []
stack = []
result = []
cur = root
while cur or stack:
if cur:
stack.append(cur)
cur = cur.left
else:
cur = stack.pop()
result.append(cur.val)
cur = cur.right
return result
94. 二叉树的中序遍历(迭代版)
最新推荐文章于 2024-06-14 09:50:01 发布