java 对称二叉树

牛客题目链接

1. 题目考点

1. 考察对二叉树中节点的操作，类似题目 合并二叉树
2. bsf + 二叉树镜像
3. dfs + 队列
4. 递归时两个节点的是否相等

2. 考点解析

1. 纯 bsf （考察对称的性质—左右子树相等）

// 调试分析递归和回溯过程
public boolean isSymmetric (TreeNode root) {
        // write code here
        if (root == null) return true;
        // 递归判断左右子树
        return check(root.left, root.right);
    }
    
    public boolean check(TreeNode left, TreeNode right) {
        if (left == null && right == null) return true;
        if (left == null || right == null || left.val != right.val) return false;
        // 关键：先左左和右右比较，回溯时再左右和右左比较
        return check(left.left, right.right) && check(left.right, right.left);
        // return 等价于 
        boolean b1 = check(left.left, right.right);
        boolean b2 = check(left.right, right.left);
        return b1 && b2;
    }

2. bsf + 二叉树镜像（最容易想到，把空节点算作 0）

	ArrayList<Integer> arr1 = new ArrayList<>();
    ArrayList<Integer> arr2 = new ArrayList<>();
    public boolean isSymmetric (TreeNode root) {
        // write code here
        if (root == null) return true;
        dfs(root);
        mirror(root);
        return isEqual(arr1, arr2);
    }
    public void dfs(TreeNode root) {
        if (root == null) {
            arr1.add(0);
            return;
        }
        arr1.add(root.val);
        dfs(root.left);
        dfs(root.right);
    }
    // 二叉树的镜像
    public void mirror(TreeNode root) {
        if (root == null) {
            arr2.add(0);
            return ;
        }
        arr2.add(root.val);
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        mirror(root.left);
        mirror(root.right);
    }
    
    public boolean isEqual(ArrayList<Integer> arr1, ArrayList<Integer> arr2) {
        for (int i = 0; i < arr1.size(); i++) {
            if (arr1.get(i) != arr2.get(i))
                return false;
        }
        return true;
    }

3. dfs 迭代

public boolean isSymmetric (TreeNode root) {
        // write code here
        if (root == null) return true;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root.left);
        queue.offer(root.right);
        while (!queue.isEmpty()) {
            TreeNode left = queue.poll();
            TreeNode right = queue.poll();
            if (left == null && right == null) continue;
            if (left == null || right == null || left.val != right.val) return false;
            
            queue.offer(left.left);
            queue.offer(right.right);
            queue.offer(left.right);
            queue.offer(right.left);
        }
        return true;
    }

4. 本质上考察的是：递归时如何判断两个节点是否相等，分三种情况

public boolean f(node1, node2) {
	// 1. 都为空，true
	if (node1 == null && node2 == null) return true;
	// 2. 只有一个为空，false
	if (node1 == null || node2 == null) return false;
	// 3. 值不相等
	if (node1.val != node2.val) return false;
	// 4. 值相等情况省略，因为递归出口是 null，属于 1

	// 2 3 合并为一种情况
	if (node1 == null || node2 == null || node1.val != node2.val) return false;
}