这是树结构
let treeArray = [
{
id: 43214,
name: '行政部',
children: [
{
id: 57541,
name: '人力资源部',
children: [
{
id: 13245,
name: '招聘组'
},
{
id: 98767,
name: 'SSC组'
}
]
},
{
id: 65436,
name: '服务运营',
children: [
{
id: 34236,
name: '前台运营组'
},
{
id: 564344,
name: '后台运营组'
}
]
}
]
},
{
id: 87567,
name: '养老部'
},
{
id: 23121,
name: '市场部',
children: [
{
id: 92463,
name: '品牌部',
children: [{
id: 87428,
name: '广告部'
},
{
id: 12835,
name: '对外合作部'
}
]
},
{
id: 32697,
name: '公关部'
}
]
}
]
dfs深度优先
function getTreeRoute(tree, id){
let path = []
function dfs(tree){
for (let i = 0; i
关注
打赏