题目地址:https://leetcode-cn.com/problems/invert-binary-tree/
看了百十来题,我仍然是一看就会,一做就废的菜鸡(有时候看都看不懂
# 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 None
root.left, root.right = root.right, root.left
self.invertTree(root.left)
self.invertTree(root.right)
return root