广度优先遍历

[peacelee]

广度优先遍历

const BreadthTraver = (node) => {
    let nodeList = [];
    let stack = [];
    if(node != null) {
        stack.push(node);
        while (stack.length) {
            let item = stack.shift();
            let children = item.children;
            nodeList.push(item);
            for(let i=0; i<children.length; i++) {
                stack.push(children[i])
            }
        }
    }
    return nodeList;
};
let BreadthNodeList = BreadthTraver(document.getElementById('box'));
console.log('BreadthNodeList==>', BreadthNodeList);