树的数据
const address = [
{
id: 1,
name: "北京市",
children: [
{ id: 11, name: "海淀区", children: [{ id: 111, name: "中关村" }] },
{ id: 12, name: "朝阳区" },
],
},
{ id: 2, name: "河北省" },
];
一、递归
代码实现
function find(data, id) {
let arr = [] // 用来存查找到的数据
function getNameById(data, id) {
data.forEach(item => {
if (item.id == id) {
arr.push(item.name)
return
}
if (item.children) {
getNameById(item.children, id)
}
})
}
getNameById(data, 11)
return arr
}
二、利用队列先进先出
function getNameById(data, id) {
let queue = []
for (let item of data) {
queue.push(item)
while (queue.length) {
let top = queue.shift()
if (top.id == id) {
return top.name
}
if (top.children) {
queue.push(...top.children)
}
}
}
}