58. 对称的二叉树

题目描述

1. 递归方法

代码实现

/**
 * @Classname Solution
 * @Description TODO
 * @Date 2019/12/23 14:11
 * @Author SonnSei
 */
public class Solution {
    public boolean isSymmetrical(TreeNode root) {
        if (root == null) {
            return true;
        }
        return isSymmetrical(root.left, root.right);
    }

    private boolean isSymmetrical(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 isSymmetrical(left.left, right.right) && isSymmetrical(left.right, right.left);
    }  
}

复杂度分析

时间复杂度：$O(n)$
空间复杂度：$O(logn)$

2. 笨拙的迭代方法

层序遍历之后判断每层是否是对称的

代码实现

/**
 * @Classname Solution3
 * @Description TODO
 * @Date 2019/12/28 9:05
 * @Author SonnSei
 */
public class Solution3 {
    public boolean isSymmetrical3(TreeNode root) {
        if (root == null) {
            return true;
        }
        ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            int size  = queue.size();
            ArrayList<Integer> curLevel= new ArrayList<>();
            for (int i = 0; i < size; i++) {
                TreeNode curNode = queue.poll();
                if (curNode != null) {
                    curLevel.add(curNode.val);
                    queue.add(curNode.left);
                    queue.add(curNode.right);
                } else {
                    curLevel.add(null);
                }
            }
            lists.add(new ArrayList<>(curLevel));
        }
        for (ArrayList<Integer> list : lists) {
            if (!symmetric(list)) {
                return false;
            }
        }
        return true;
    }

    /**
     * 检测某个list中的元素是否是对称的
     * @param list
     * @return
     */
    private boolean symmetric(ArrayList<Integer> list) {
        for (int i = 0; i < list.size() / 2; i++) {
            Integer value = list.get(i);
            if (value == null && list.get(list.size() - i - 1) != null) {
                return false;
            }
            if (value!=null && !value.equals(list.get(list.size() - i - 1))) {
                return false;
            }
        }
        return true;
    }
}

复杂度分析

都是$O(n)$

3. 巧妙的迭代方法

代码实现

/**
 * @Classname Solution2
 * @Description TODO
 * @Date 2019/12/28 9:05
 * @Author SonnSei
 */
public class Solution2 {
    public boolean isSymmetrical2(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        queue.add(root);
        while (!queue.isEmpty()) {
            TreeNode node1 = queue.poll();
            TreeNode node2 = queue.poll();
            if (node1 == null && node2 == null) {
                continue;
            }
            if (node1 == null || node2 == null) {
                return false;
            }
            if (node1.val != node2.val) {
                return false;
            }
            queue.add(node1.left);
            queue.add(node2.right);
            queue.add(node1.right);
            queue.add(node2.left);
        }
        return true;
    }
}

复杂度分析

都是$O(n)$