"van Emde Boas tree" meaning in All languages combined

{
  "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "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"
}

{
  "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "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"
}