@@ -0,0 +1,626 @@
+/**%0A * Invert a binary tree.%0A *%0A *       4%0A *     /   %5C%0A *    2     7%0A *   / %5C   / %5C%0A *  1   3 6   9%0A *%0A * to%0A *%0A *       4%0A *     /   %5C%0A *    7     2%0A *   / %5C   / %5C%0A *  9   6 3   1%0A *%0A * Tags: Tree%0A *%0A */%0Apublic class InvertBinaryTree %7B%0A%0A    public TreeNode invertTree(TreeNode root) %7B%0A        if (root == null) return null;%0A%0A        TreeNode node = root.left;%0A        root.left = invertTree(root.right);%0A        root.right = invertTree(node);%0A%0A        return root;%0A    %7D%0A%0A    class TreeNode %7B%0A%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A%0A        TreeNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%7D%0A

add 226 Invert Binary Tree