力扣题,二叉树的翻转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
题目原址