2-3 tree in All languages combined

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "forms": [
    {
      "form": "2-3 trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "2-3 tree"
      },
      "expansion": "2-3 tree (plural 2-3 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": "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 children and one data element, or three children and two data elements; a B-tree of order 3."
      ],
      "id": "en-2-3_tree-en-noun-rgKiqdAJ",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "node",
          "node"
        ],
        [
          "child",
          "child"
        ],
        [
          "B-tree",
          "B-tree"
        ],
        [
          "order",
          "order"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A tree data structure whose every node with children (internal node) has either two children and one data element, or three children and two data elements; a B-tree of order 3."
      ],
      "related": [
        {
          "word": "2-3-4 tree"
        },
        {
          "word": "2-4 tree"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "2-3 tree"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

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

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-09 from the enwiktionary dump dated 2024-05-02 using wiktextract (4d5d0bb and edd475d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.

"2-3 tree" meaning in All languages combined

Noun [English]