var data2 = [
{
id: 1,
label: '一级 1',
children: [{
id: 4,
label: '二级 2',
children: [{
id: 9,
label: '三级 3'
}, {
id: 10,
label: '三级 1-3'
}]
}]
},
{
id: 2,
label: '一级 2',
children: [{
id: 5,
label: '二级 2-1'
}, {
id: 6,
label: '二级 2-2'
}]
},
{
id: 3,
label: '一级 3',
children: [{
id: 7,
label: '二级 3-1'
}, {
id: 8,
label: '二级 3-2'
}]
}];
recursion(list, callback) {
let _this = this
for (let i in list) {
if (list[i].children) {
let node = _this.recursion(list[i].children)
if(node !== undefined){
callback(node.concat(list[i]))
}
}
if (list[i].classificCode.indexOf(this.form.classificCode) > -1) {
return [list[i]]
}
}
},
js递归获取父节点
最新推荐文章于 2024-05-06 18:26:11 发布