LeetCode101 & 剑指Offer 28 对称的二叉树

题目

解题

解题一：深度优先搜索

// javascript
var isSymmetric = function(root) {
    return checkSymmetric(root, root);
};

var checkSymmetric = function(p, q) {
    if (p === null && q === null) return true;
    if (p === null || q === null) return false;
    return (p.val === q.val) && checkSymmetric(p.left, q.right) && checkSymmetric(p.right, q.left);
};

解题二：广度优先搜索

// javascript
var isSymmetric = function(root) {
    return checkSymmetric(root, root);
};

var checkSymmetric = function(u, v) {
    const queue = [u, v];
    while (queue.length > 0) {
        u = queue.shift();
        v = queue.shift();
        if (u === null && v === null) continue;
        if ((u === null || v === null) || (u.val !== v.val)) return false;
        queue.push(u.left);     // 左子树的左孩子
        queue.push(v.right);    // 右子树的右孩子
        queue.push(u.right); 
        queue.push(v.left);
    }
    return true;
};