forEachTree(tree,children='children',id='id',pid='pid',fun=()=>{}){
let fn = (id, ar,children) =>{
ar.forEach(e=>{
fun(e)
if (e[children]) fn(e[id], e[children], children);
})
}
fn(0,tree,children);
}
遍历树结构
最新推荐文章于 2023-09-26 16:11:19 发布