TS & JS 层序遍历节点树

export interface Node {
    name: string;
    level: number;
    nodes: Array<Node>;
}

let testNode: Node = {
    name: 'test node',
    level: 0,
    nodes: [
        {
            name: 'node 1', level: 0, nodes: [
                {
                    name: 'node 1-1', level: 0, nodes: [
                        { name: 'node 1-1-1', level: 0, nodes: [] },
                        { name: 'node 1-1-2', level: 0, nodes: [] }
                    ]
                },
                { name: 'node 1-2', level: 0, nodes: [] }
            ]
        },
        {
            name: 'node 2', level: 0, nodes: [
                { name: 'node 2-1', level: 0, nodes: [] }
            ]
        },
        { name: 'node 3', level: 0, nodes: [] }
    ]
}

getNodesLevel(testNode);
console.log(testNode);

function getNodesLevel(node: Node) {
    let level: number = 0;
    let queue = [];
    queue.push(node);

    while (queue.length > 0) {
        let currentNode: Node = <Node>queue.shift();

        if (currentNode && currentNode.nodes) {
            level = currentNode.level + 1;
            currentNode.nodes.forEach(element => {
                element.level = level;
                queue.push(element);
            });
        }
    }
}