[二叉树&栈] 二叉树前序遍历和中序遍历的迭代写法

[二叉树&栈] 二叉树前序遍历和中序遍历的迭代写法

前序遍历

LeetCode 144. 二叉树的前序遍历

class Solution:
    def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        ans = []
        stack = deque()
        cur = root
        if cur is None:
            return ans
        
        while stack or cur:
            while cur:
                stack.append(cur.right)
                ans.append(cur.val)
                cur = cur.left
            cur = stack.pop()
        return ans

中序遍历

LeetCode 94. 二叉树的中序遍历

class Solution:
    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        ans = []
        stack = deque()
        cur = root
        if cur is None:
            return ans

        while stack or cur:
            while cur:
                stack.append(cur)
                cur = cur.left
            cur = stack.pop()
            ans.append(cur.val)
            cur = cur.right
        return ans