题解 | #对称的二叉树 递归#

/* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null;

public TreeNode(int val) {
    this.val = val;

}

} */

import java.util.*;

public class Solution {

boolean isSymmetrical(TreeNode pRoot) {

    return check(pRoot,pRoot);
}

public static boolean check(TreeNode leftRoot, TreeNode rightRoot){
    if(leftRoot == null && rightRoot == null){return true;}
    if(leftRoot == null || rightRoot == null){return false;}
    if(leftRoot.val != rightRoot.val){return false;}
    return check(leftRoot.left,rightRoot.right) && check(leftRoot.right, rightRoot.left);
}

}