leetcode-Symmetric Tree

判断一个节点的左右子树是否满足boolean isl=symm(left.left,right.right);boolean isr=symm(left.right,right.left);即可

public class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root==null)
    		return true;
    	return symm(root.left,root.right);
    }
    
     public static boolean symm(TreeNode left,TreeNode right)
    {
    	if(left==null&&right==null)
    		return true;
    	if(left==null||right==null)
    		return false;
    	if(left.val!=right.val)
    		return false;
    	boolean isl=symm(left.left,right.right);
    	boolean isr=symm(left.right,right.left);
    	return isl&&isr;
    }
}