day15打卡

5. 层序遍历

var levelOrder = function(root) {
    let res = [];
    let queue = [];
    if(!root) {
        return res;
    }
    queue.push(root);
    while(queue.length) {
        let length = queue.length; //因为循环会改变queue的长度所以这里就要储存queue.length的值
        let curRes = [];
        for(let i = 0; i < length; i++) {
            let node = queue.shift();
            curRes.push(node.val);
            if(node.left) {
                queue.push(node.left)
            }
            if(node.right) {
                queue.push(node.right)
            }
        }
        res.push(curRes);
    }
    return res;
};

6. 翻转二叉树（难以理解）

var invertTree = function(root) {
    if (root === null) {
        return null;
    }
    const left = invertTree(root.left);
    const right = invertTree(root.right);
    root.left = right;
    root.right = left;
    return root;
};

7. 对称二叉树

var isSymmetric = function(root) {
    //使用递归遍历左右子树 递归三部曲
    // 1. 确定递归的参数 root.left root.right和返回值true false 
    const compareNode=function(left,right){
        //2. 确定终止条件 空的情况
        if(left===null&&right!==null||left!==null&&right===null){
            return false;
        }else if(left===null&&right===null){
            return true;
        }else if(left.val!==right.val){
            return false;
        }
        //3. 确定单层递归逻辑
        let outSide=compareNode(left.left,right.right);
        let inSide=compareNode(left.right,right.left);
        return outSide&&inSide;
    }
    if(root===null){
        return true;
    }
    return compareNode(root.left,root.right);
};