@@ -0,0 +1,573 @@
+package me.wayne.leetcodetop100.binarytree;%0A%0Aimport me.wayne.leetcodetop100.TreeNode;%0A%0A/**%0A * %E7%BB%99%E4%BD%A0%E4%B8%80%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%A0%B9%E8%8A%82%E7%82%B9 root %EF%BC%8C%E7%BF%BB%E8%BD%AC%E8%BF%99%E6%A3%B5%E4%BA%8C%E5%8F%89%E6%A0%91%EF%BC%8C%E5%B9%B6%E8%BF%94%E5%9B%9E%E5%85%B6%E6%A0%B9%E8%8A%82%E7%82%B9%E3%80%82%0A * %3Cp%3E%0A * https://leetcode-cn.com/problems/invert-binary-tree/%0A */%0Apublic class LC226_InvertTree %7B%0A%0A    public TreeNode invertTree(TreeNode root) %7B%0A        if (root == null %7C%7C (root.left == null && root.right == null)) %7B%0A            return root;%0A        %7D%0A%0A        TreeNode temp = root.left;%0A        root.left = root.right;%0A        root.right = temp;%0A%0A        invertTree(root.left);%0A        invertTree(root.right);%0A        return root;%0A    %7D%0A%7D%0A

add LC226_InvertTree