JavaScript遍曆樹結構

標籤：queue   const   非遞迴遍曆   let   asc   travel   return   for   treenode   

遍曆

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)        }    }}

JavaScript遍曆樹結構