leetcode226. 翻转二叉树

def invertTree(self, root):
        """
        递归实现
        """
        if not root:
            return None
        t = root.left
        root.left = root.right
        root.right = t
        self.invertTree(root.left)
        self.invertTree(root.right)
        return root