@@ -0,0 +1,583 @@
+%22%22%22%0A%5Bref.href%5D leetcode.com/problems/invert-binary-tree%0A%22%0A  Invert a binary tree.%0A%22%0A%22%22%22%0A%0A# Definition for a binary tree node.%0A# class TreeNode(object):%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.left = None%0A#         self.right = None%0A%0Aclass Solution(object):%0A    def invertTree(self, root):%0A        %22%22%22%0A        :type root: TreeNode%0A        :rtype: TreeNode%0A        %22%22%22%0A        if root == None:%0A            return%0A        root.left, root.right = root.right, root.left%0A        self.invertTree(root.left)%0A        self.invertTree(root.right)%0A        return root%0A

Create invertBinaryTree.py