题目如题,这道题很简单,没什么要说的,直接放代码。
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root:return root
root.left, root.right = root.right, root.left
self.invertTree(root.left)
self.invertTree(root.right)
return root
需要注意的是:必须有if not root那行,不然会报错AttributeError: ‘NoneType’ object has no attribute ‘right’ 原因是可能存在空节点。