JavaScript遍历树结构

2024-10-16 22:04:25

遍历

function parseTreeJson(treeNodes){

    if(!treeNodes||!treeNodes.length)return;

    for(let i=0;i<treeNodes.length;i++){

        let childs=treeNodes[i].children;

        console.log(treeNodes[i].key)

        if(childs&&childs.length>0){

            parseTreeJson(childs);

        }

    }

}

广度非递归遍历

const travelWidely=(roots)=>{

    const queue = [...roots];

    while (queue.length){

        const node = queue.shift();

        //打印被遍历的节点

        if(node===undefined) return;

        console.log(`${node.title} ${node.children && node.children.length || ""}`);

        if(node.children&&node.children.length){

            queue.push(...node.children)

        }

    }

}

最新文章

热门文章