树的广度遍历
```js
const getRes = (data, res = []) => {
for (let i = 0; i < data.length; i++) {
res.push(data[i].id)
if (data[i].children) data.push(...data[i].children)
}
return res
}
```
展开
前端手术刀于2022-07-21 09:07发布的图片
评论