@supuwoerc/toolkit
    Preparing search index...

    Function bfs

    • 广度优先遍历树结构 / Breadth-first search traversal of tree structure

      Type Parameters

      • T = TreeNode

        树节点数据类型 / Tree node data type

      • K extends string = "children"

        子节点属性键类型 / Child node property key type

      Parameters

      • tree: Tree<T, K>

        树形结构的根节点 / Root node of the tree structure

      • callback: (node: Tree<T, K>) => boolean | void

        遍历每个节点时执行的回调函数,返回false可中断遍历 / Callback function executed for each node, return false to break traversal

      • childrenKey: K = ...

        子节点属性名,默认为'children' / Child node property name, defaults to 'children'

      Returns void

      // 示例用法 / Example usage
      const tree = {
      value: 1,
      children: [
      { value: 2, children: [] },
      { value: 3, children: [] }
      ]
      };

      bfs(tree, (node) => {
      console.log(node.value);
      // 返回false可中断遍历 / Return false to break traversal
      if (node.value === 2) return false;
      });