fix: fix 101

Author: Blankj

note/101/README.md

@@ -47,13 +47,13 @@ Bonus points if you could solve it both recursively and iteratively.
  */
 class Solution {
     public boolean isSymmetric(TreeNode root) {
-        return root == null || isSymmetricHelper(root.left, root.right);
+        return root == null || helper(root.left, root.right);
     }
 
     public boolean helper(TreeNode left, TreeNode right) {
         if (left == null || right == null) return left == right;
         if (left.val != right.val) return false;
-        return isSymmetricHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);
+        return helper(left.left, right.right) && helper(left.right, right.left);
     }
 }
 ```

src/com/blankj/easy/_101/Solution.java

@@ -15,13 +15,13 @@
  */
 public class Solution {
 //    public boolean isSymmetric(TreeNode root) {
-//        return root == null || isSymmetricHelper(root.left, root.right);
+//        return root == null || helper(root.left, root.right);
 //    }
 //
 //    private boolean helper(TreeNode left, TreeNode right) {
 //        if (left == null || right == null) return left == right;
 //        if (left.val != right.val) return false;
-//        return isSymmetricHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);
+//        return helper(left.left, right.right) && helper(left.right, right.left);
 //    }
 
     public boolean isSymmetric(TreeNode root) {