"2-3-4 tree" meaning in All languages combined

{
  "forms": [
    {
      "form": "2-3-4 trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "2-3-4 tree"
      },
      "expansion": "2-3-4 tree (plural 2-3-4 trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes."
      ],
      "id": "en-2-3-4_tree-en-noun-NV6vrvRV",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "node",
          "node"
        ],
        [
          "child",
          "child"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes."
      ],
      "related": [
        {
          "word": "2-3 tree"
        }
      ],
      "synonyms": [
        {
          "word": "2-4 tree"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "2-3-4 tree"
}

{
  "forms": [
    {
      "form": "2-3-4 trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "2-3-4 tree"
      },
      "expansion": "2-3-4 tree (plural 2-3-4 trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "2-3 tree"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms spelled with numbers",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "node",
          "node"
        ],
        [
          "child",
          "child"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes."
      ],
      "synonyms": [
        {
          "word": "2-4 tree"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "2-3-4 tree"
}