See order statistic tree on Wiktionary
Download JSON data for order statistic tree meaning in All languages combined (1.7kB)
{ "forms": [ { "form": "order statistic trees", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "order statistic tree (plural order statistic 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 variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree)." ], "id": "en-order_statistic_tree-en-noun-fpS1s1Ap", "links": [ [ "computing", "computing#Noun" ], [ "theory", "theory" ], [ "binary", "binary" ], [ "search tree", "search tree" ], [ "B-tree", "B-tree" ] ], "raw_glosses": [ "(computing theory) A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree)." ], "topics": [ "computing", "computing-theory", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ] } ], "word": "order statistic tree" }
{ "forms": [ { "form": "order statistic trees", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "order statistic tree (plural order statistic trees)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "en:Theory of computing" ], "glosses": [ "A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree)." ], "links": [ [ "computing", "computing#Noun" ], [ "theory", "theory" ], [ "binary", "binary" ], [ "search tree", "search tree" ], [ "B-tree", "B-tree" ] ], "raw_glosses": [ "(computing theory) A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree)." ], "topics": [ "computing", "computing-theory", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences" ] } ], "word": "order statistic 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-18 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.