@@ -0,0 +1,479 @@
+// public class TreeNode %7B%0A//     int val;%0A//     TreeNode left;%0A//     TreeNode right;%0A//     TreeNode(int x) %7B val = x; %7D%0A// %7D%0A%0Aclass Solution %7B%0A    public TreeNode invertTree(TreeNode root) %7B%0A        if (root == null) %7B%0A            return root;%0A        %7D%0A        %0A        root.left = invertTree(root.left);%0A        root.right = invertTree(root.right);%0A%0A        TreeNode temp = root.left;%0A        root.left = root.right;%0A        root.right = temp;%0A%0A        return root;%0A    %7D%0A%7D

226. Invert Binary Tree