function traverseTree(arr, flag) {
复制
for (let i = 0; i < arr.length; i ) { if (arr[i].id === 1) { flag = true; break; }
if (arr[i].children && arr[i].children.length > 0) { flag = traverseTree(arr[i].children, flag); if (flag) { break; } }
复制
}
return flag; }
// Example const tree = [{ id: 0, children: [{ id: 1 }] }, { id: 2, children: [{ id: 3 }] }];
let flag = false; if (traverseTree(tree, flag)) { console.log('Flag is true'); } else { console.log('Flag is false'); }