es6 map结构,递归树,
// 递归数组
filterArray(arr) {
let map = {};
arr.forEach(v => {
map[v.orgCode] = v;
});
let treeData = [];
arr.forEach(child => {
const mapItem = map[child.parentCode];
if (mapItem) {
(mapItem.children || (mapItem.children = [])).push(child);
} else {
treeData.push(child);
}
});
return treeData;
},