记录简单扁平数据结构转成树结构练习

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": [
                    // 结果 ,,,
                ]
            }
        ]
    }
]

function toTree(pid,arr){
	return arr.filter(item=>item.pid===pid)
			  .map(item=>({...item,children:toTree(item.id,arr)}))
}

console.log(toTree(0,arr))

function arrToTree(arr){
    const res = []
    const map = {}
    for(let item of arr){
        let id = item.id
        let pid = item.pid
        map[id] = {
            ...item,
            children:[],
        }
        const childrenItem = map[id]
        if(pid==0){
            res.push(childrenItem)
        }else{
            map[pid].children.push(childrenItem)
        }
    }
    return res
}