@@ -0,0 +1,506 @@
+/**%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        invert(root);%0A        return root;%0A    %7D%0A    %0A    private void invert(TreeNode n) %7B%0A        if(n == null) return;%0A        TreeNode tmp = n.left;%0A        n.left = n.right;%0A        n.right = tmp;%0A        invert(n.left);%0A        invert(n.right);%0A    %7D%0A%7D%0A

Create 226.java