@@ -0,0 +1,502 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public TreeNode invertTree(TreeNode root) %7B%0A        if (root != null) %7B%0A            TreeNode tmp = root.left;%0A            root.left = root.right;%0A            root.right = tmp;%0A            %0A            invertTree(root.left);%0A            invertTree(root.right);%0A        %7D%0A        return root;%0A    %7D%0A%7D%0A

Create InvertBinaryTree_001.java