LeetCode T226. 翻转二叉树

方法一：递归法

思路：

递归遍历（dfs）二叉树，交换每个节点的左 / 右子节点 

代码：

# Definition for a binary tree node.
from typing import Optional


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return None
        root.left, root.right = root.right, root.left
        self.invertTree(root.left)
        self.invertTree(root.right)
        return root

方法二：辅助栈（或队列）

思路：

利用栈（或队列）遍历树的所有节点node，并交换每个node的左 / 右子节点。

代码：

# Definition for a binary tree node.
from typing import Optional


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return None
        stack = [root]
        while stack:
            node = stack.pop()
            if node.left: 
                stack.append(node.left)
            if node.right: 
                stack.append(node.right)
            node.left, node.right = node.right, node.left
        return root