扁平数据转Tree 树 树形结构

源数据：

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},
];

需要输出：

[
    {
        "id": 1,
        "name": "部门1",
        "pid": 0,
        "children": [
            {
                "id": 2,
                "name": "部门2",
                "pid": 1,
                "children": [
                    {...}
                ]
            },
            {
                "id": 3,
                "name": "部门3",
                "pid": 1,
                "children": [
                    {...}
                ]
            }
        ]
    }
]

最简单办法，排序之后循环（filter 也可以循环）

function ToTree(arr){
    return arr
            .sort((a, b) => b.pid - a.pid)
            .filter(item=>{
                item.children = arr.filter(subitem=> subitem.pid === item.id);
                return item.pid ===0;
            })
}

考虑性能的话，可以将数据转为Map

function arrayToTree(arr) {
  const result = [];   // 存放结果
  const mapData = {};  // 
  for (let item of arr) {
    const id = item.id;
    const pid = item.pid;

    if (!mapData[id]) {
      mapData[id] = {
        children: [],
      }
    }

    mapData[id] = {
      ...item,
      children: mapData[id]['children']
    }

    const treeItem =  mapData[id];

    if (pid === 0) {
      result.push(treeItem);
    } else {
      if (!mapData[pid]) {
        mapData[pid] = {
          children: [],
        }
      }
      mapData[pid].children.push(treeItem)
    }

  }
  return result;
}