van Emde Boas tree in English

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

{
  "etymology_text": "Named after Peter van Emde Boas.",
  "forms": [
    {
      "form": "van Emde Boas trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "van Emde Boas tree"
      },
      "expansion": "van Emde Boas tree (plural van Emde Boas 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": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m."
      ],
      "id": "en-van_Emde_Boas_tree-en-noun-71rfCZAp",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "associative array",
          "associative array"
        ],
        [
          "key",
          "key"
        ],
        [
          "bit",
          "bit"
        ]
      ],
      "raw_glosses": [
        "(computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Peter van Emde Boas"
      ]
    }
  ],
  "word": "van Emde Boas tree"
}

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

{
  "etymology_text": "Named after Peter van Emde Boas.",
  "forms": [
    {
      "form": "van Emde Boas trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "van Emde Boas tree"
      },
      "expansion": "van Emde Boas tree (plural van Emde Boas trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "associative array",
          "associative array"
        ],
        [
          "key",
          "key"
        ],
        [
          "bit",
          "bit"
        ]
      ],
      "raw_glosses": [
        "(computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Peter van Emde Boas"
      ]
    }
  ],
  "word": "van Emde Boas tree"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.

"van Emde Boas tree" meaning in English

Noun