@@ -0,0 +1,761 @@
+/**%0A * Definition of TreeNode:%0A * public class TreeNode %7B%0A *     public int val;%0A *     public TreeNode left, right;%0A *     public TreeNode(int val) %7B%0A *         this.val = val;%0A *         this.left = this.right = null;%0A *     %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    /**%0A     * @param root: a TreeNode, the root of the binary tree%0A     * @return: nothing%0A     */%0A    public void invertBinaryTree(TreeNode root) %7B%0A        if (root == null) %7B%0A            return;%0A        %7D%0A        TreeNode temp = root.left;%0A        root.left = root.right;%0A        root.right = temp;%0A        %0A        if (root.left != null) %7B%0A            invertBinaryTree(root.left);%0A        %7D%0A        if (root.right != null) %7B%0A            invertBinaryTree(root.right);%0A        %7D%0A        %0A    %7D%0A%0A%7D%0A

Create InvertBinaryTree.java