二叉树层次遍历

Posted 2021-02-12 coderzx

function levelOrder (root) {
    if (!root){
        return false;
    }
    var tree = [];//存放待遍历的节点
    var result = [];//存放遍历后的结果
    tree.push(root)
    while (tree.length){
        var node = tree.shift();
        result.push(node);
        if (node.left) {
            tree.push(node.left)
        }
        if(node.right) {
            tree.push(node.right)
        }
    }
    return result;
}
利用了队列先进先出的机制，遍历每一层的节点