力扣题，二叉树的翻转python

力扣题，二叉树的翻转python# 定义class TreeNode:def __init__(self, x):self.val = xself.left = Noneself.right = None# 解决class Solution:def invertTree(self, root):if not root:return Noneroot.left,ro

焦志坤

376人浏览 · 2020-07-03 17:12:09

焦志坤 · 2020-07-03 17:12:09 发布

力扣题，二叉树的翻转python

在这里插入图片描述

# 定义
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
# 解决
class Solution:
    def invertTree(self, root):
        if not root:
            return None
        root.left,root.right=self.invertTree(root.right),self.invertTree(root.left)
        return root