判断对称二叉树

一、思路

递归过程是这样的，只有到叶子节点才会有返回值，当一个节点的左右子节点都递归之后，接着会继续递归当前节点的父节点的右子节点，然后在继续…

二、递归实现

public boolean determineSymmetricalBinaryTree(TreeNode root) {
 return determineSymmetricalBinaryTree(root.left, root.right);
}

public boolean determineSymmetricalBinaryTree(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;
    }
    // 先判断左子树的左子树和右子树的右子树，然后在判断左子树的右子树和右子树的左子树
    return determineSymmetricalBinaryTree(left.left, right.right) &&
            determineSymmetricalBinaryTree(left.right, right.left);
}

public class TreeNode {
    public int val;
    public TreeNode left;
    public TreeNode right;

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