@@ -0,0 +1,713 @@
+package com.leetcode.tree;%0A%0Apublic class LeetCode0101 %7B%0A%09  public class TreeNode %7B%0A%09      int val;%0A%09      TreeNode left;%0A%09      TreeNode right;%0A%09      TreeNode(int x) %7B val = x; %7D%0A%09  %7D%0A%09  %0A%09  public boolean isSymmetric(TreeNode root) %7B%0A%09        if(root == null)%7B%0A%09            return true;%0A%09        %7D%0A%09        return isSymmetricTree(root.left,root.right);%0A%09    %7D%0A%09    private boolean isSymmetricTree(TreeNode p, TreeNode q)%7B%0A%09        if(p==null && q==null)%0A%09            return true;%0A%09        if((p==null && q!=null)%7C%7C(p!=null && q==null))%0A%09            return false;%0A%09        if(p.val!= q.val)%0A%09            return false;%0A%09        return isSymmetricTree(p.left,q.right) && isSymmetricTree(p.right, q.left);%0A%09    %7D%0A%7D%0A

Add LeetCode101.java