【LeetCode】101. Symmetric Tree-对称树/镜像树

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