let tree = [
{
id: 0,
name: "0",
children: [
{
id: 01,
name: "01",
children: [
{
id: 011,
name: "011",
children: []
}
]
},
{
id: 02,
name: "02",
children: []
}
]
},
{
id: 1,
name: "1",
children: [
{
id: 11,
name: "11",
children: [
{
id: 111,
name: "111",
children: []
}
]
},
{
id: 12,
name: "12",
children: []
}
]
}
];
function queryTreeName(id, tree) {
let result;
let fn = function (id, tree) {
for (let index = 0; index < tree.length; index++) {
const element = tree[index];
if (element.id === id) {
result = element.name
break
} else if (element.id !== id && element.children && element.children.length > 0) {
fn(id, element.children)
}
}
}
fn(id, tree)
console.log(result)
return result
};
let name = queryTreeName(1, tree)
树形结构数据根据ID查找name
最新推荐文章于 2022-12-01 11:45:00 发布