@@ -0,0 +1,634 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/invert-binary-tree/%0A */%0Apublic class Problem226 %7B%0A    public static class TreeNode %7B%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A%0A        TreeNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public TreeNode invertTree(TreeNode root) %7B%0A        invert(root);%0A        return root;%0A    %7D%0A    %0A    private void invert(TreeNode node) %7B%0A        if (node == null) %7B%0A            return;%0A        %7D%0A        TreeNode tmp = node.left;%0A        node.left = node.right;%0A        node.right = tmp;%0A        invertTree(node.left);%0A        invertTree(node.right);%0A    %7D%0A%7D%0A

Solve problem 226