扁平的数据结构,转成树{id->pid}
扁平数据:
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: [
// 结果 ,,,
]
}
]
}
];
code:
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 newTreeArr = this.treeFun([arr[0]], arr);
treeFun(obj, arr) {
obj.forEach(objItem => {
objItem.children = objItem.children ? objItem.children : [];
arr.forEach(item => {
if (item.pid === objItem.id) {
objItem.children.push(item);
this.treeFun(objItem.children, arr);
}
});
});
return obj;
},