时间复杂度(O(n)),思想:树先序遍历
# 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 root is None : return root
root.right, root.left = root.left, root.right
self.invertTree(root.right)
self.invertTree(root.left)
return root