leetcode 翻转二叉树实现代码

# 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):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        if not root:return 
        root.left,root.right=self.invertTree(root.right),self.invertTree(root.left)
        return root