leetcode——101

递归判断二叉树是否对称

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        return ismirror(root,root);
    }
    public boolean ismirror(TreeNode r1,TreeNode r2){
        if(r1 == null && r2 == null) return true;
        if(r1 == null || r2 == null) return false;
        return (r1.val == r2.val) && ismirror(r1.right,r2.left) && ismirror(r1.left,r2.right);
    }
}