用于 n 叉树的 Javascript 算法来查找具有最多子节点的节点

Question

我一直在寻找一种基本的 JavaScript 算法来解决这个问题，但找不到，也无法从头开始创建它。

例如，他下面的直接和间接子节点数量最多的节点。 所以对于下面的数据结构，我希望节点'12'被返回，因为它比节点'11'有更多的死者

tree = {
  "id": 1,
"children": [
    {
      "id": 11,
      "children": [
        {
          "id": 111,
          "children": []
        },
        {
          "id": 112,
          "children": [
            {
              "id": 1121,
              "children": []
            },
            {
              "id": 1122,
              "children": []
            }
          ]
        }
      ]
    },
    {
      "id": 12,
      "children": [
        {
          "id": 121,
          "children": []
        },
        {
          "id": 122,
          "children": [
            {
              "id": 8888,
              "children": []
            },
            {
              "id": 5555,
              "children": [
                {
                  "id": 6666,
                  "children": []
                },
                {
                  "id": 121212,
                  "children": []
                }
              ]
            }
            ]
        }
      ]
    }
  ]
};

如果我很困惑，将不胜感激。

Answer 1

您可以为每个根子节点映射部门，并通过采用具有最多子节点的数组来减少数组。

const
    getC = ({ children }) => children?.reduce((sum, node) => sum + getC(node), 1) || 1,
    findNodeWithMostChildren = node => node.children
        .map((node) => [node, getC(node)])
        .reduce((a, b) => b[1] > a[1] ? b : a)
        [0],
    tree = { id: 1, children: [{ id: 11, children: [{ id: 111, children: [] }, { id: 112, children: [{ id: 1121, children: [] }, { id: 1122, children: [] }] }] }, { id: 12, children: [{ id: 121, children: [] }, { id: 122, children: [{ id: 8888, children: [] }, { id: 5555, children: [{ id: 6666, children: [] }, { id: 121212, children: [] }] }] }] }] };

console.log(findNodeWithMostChildren(tree));

.as-console-wrapper { max-height: 100% !important; top: 0; }