扁平数据结构转Tree

无意中刷掘金看到的

原文地址： juejin.cn/post/698390…

嘿~我居然碰到过

废话不多说，先上代码

 let arr = [
    { id: 1, name: '部门1', pid: 0 },
    { id: 2, name: '部门2', pid: 1 },
    { id: 3, name: '部门3', pid: 1 },
    { id: 4, name: '部门4', pid: 3 },
    { id: 5, name: '部门5', pid: 4 },
  ]
  const buildDataToTree = (data, pId) => {
    let temp = []
    let result = []
    data.forEach(element => {
      if(element.pid === pId){
        let obj = {
          id: element.id,
          name: element.name,
          pid: element.pid
        }
        temp = buildDataToTree(data, element.id)
        if (temp.length > 0) {
          obj.children = temp;
        }
        result.push(obj);
      }
    });
    return result;
  }
  
  console.log(buildDataToTree(arr, 0))

结果