We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 512deff commit 2bf33faCopy full SHA for 2bf33fa
1 file changed
js/tree-v1/tree-node.ts
@@ -1405,6 +1405,7 @@ export class TreeNode {
1405
// 使用栈实现深度优先遍历,避免递归调用栈溢出
1406
while (stack.length > 0) {
1407
const node = stack.pop();
1408
+ if (!node) continue;
1409
list.push(node);
1410
if (Array.isArray(node.children) && node.children.length > 0) {
1411
for (let i = node.children.length - 1; i >= 0; i--) {
0 commit comments