树(4)——翻转二叉树(T.226)

题目描述

题解

题解1：

# 递归
class Solution:
    def invertTree(self, root: TreeNode) -> TreeNode:
        if not root:return None

        if root.left:
            node_left = self.invertTree(root.left)
        else:
            node_left = None
        if root.right:
            node_right = self.invertTree(root.right)
        else:
            node_right = None
        root.left = node_right
        root.right = node_left

        return root

题解2：

# 栈实现
class Solution:
    def invertTree(self, root):
        stack = [root]
        while stack:
            node = stack.pop()
            if node:
                node.left, node.right = node.right, node.left
                stack.append(node.right)
                stack.append(node.left)
        return root

总结

暂无。