package com.leetcode.tree;

public class LeetCode0101 {
	  public class TreeNode {
	      int val;
	      TreeNode left;
	      TreeNode right;
	      TreeNode(int x) { val = x; }
	  }
	  
	  public boolean isSymmetric(TreeNode root) {
	        if(root == null){
	            return true;
	        }
	        return isSymmetricTree(root.left,root.right);
	    }
	    private boolean isSymmetricTree(TreeNode p, TreeNode q){
	        if(p==null && q==null)
	            return true;
	        if((p==null && q!=null)||(p!=null && q==null))
	            return false;
	        if(p.val!= q.val)
	            return false;
	        return isSymmetricTree(p.left,q.right) && isSymmetricTree(p.right, q.left);
	    }
}

@@ -448,16 +448,18 @@
 q==null)
+ %7B
 %0A%09      
@@ -452,36 +452,33 @@
 ull) %7B%0A%09        
-    
+%09
 return true;%0A%09  
@@ -478,21 +478,32 @@
 ue;%0A%09   
+ 
+    %7D%0A%09
      
+   
 if((p==n
@@ -540,16 +540,18 @@
 ==null))
+ %7B
 %0A%09      
@@ -544,36 +544,33 @@
 ll)) %7B%0A%09        
-    
+%09
 return false;%0A%09 
@@ -559,32 +559,46 @@
  %09return false;%0A
+%09        %7D   %0A
 %09        if(p.va
@@ -607,30 +607,28 @@
 = q.val)
+ %7B
 %0A%09
-    
         
 return f
@@ -615,24 +615,25 @@
  %7B%0A%09        
+%09
 return false
@@ -625,32 +625,46 @@
   %09return false;
+  %09%0A%09        %7D
 %0A%09        return

update LeetCod0101e.java