Iterativer Tiefensuch-VNode-Traversierungs-Engine für komplexe Komponentenbäume

function traverseVNodeTree(rootVNode, visitor) {
  const stack = [{ node: rootVNode, depth: 0 }];
  while (stack.length > 0) {
    const { node, depth } = stack.pop();
    if (!node || typeof node !== 'object') continue;
    const shouldContinue = visitor(node, depth);
    if (shouldContinue === false) break;
    if (Array.isArray(node.children)) {
      for (let i = node.children.length - 1; i >= 0; i--) {
        stack.push({ node: node.children[i], depth: depth + 1 });
      }
    }
  }
}