JS 【详解】树的遍历（含深度优先遍历和广度优先遍历的算法实现）

let tree = [
    {
        label:'a',
        children:[
            {
                label:'b',
                children:[
                    {
                        label:'d'
                    },
                    {
                        label:'e'
                    }
                ]
            },
            {
                label:'c',
                children:[
                    {
                        label:'f'
                    }
                ]
            }
        ]
    }
]

function DFS(tree) {
  tree.forEach((node) => {
    console.log(node.label);
    node.children && DFS(node.children);
  });
}

function BFS(tree) {
  let queue = tree;
  for (let i = 0; i < queue.length; i++) {
    console.log(queue[i].label);
    if (queue[i].children) {
      queue = queue.concat(queue[i].children);
    }
  }
}