See link/cut tree on Wiktionary
{
"etymology_text": "Invented by Daniel Dominic Sleator and Robert Endre Tarjan in 1982.",
"forms": [
{
"form": "link/cut trees",
"tags": [
"plural"
]
},
{
"form": "link cut tree",
"tags": [
"alternative"
]
}
],
"head_templates": [
{
"args": {
"head": "link/cut tree"
},
"expansion": "link/cut tree (plural link/cut 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 data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time."
],
"id": "en-link/cut_tree-en-noun-KTrql4Ak",
"links": [
[
"computer science",
"computer science"
],
[
"data structure",
"data structure"
],
[
"forest",
"forest"
],
[
"rooted",
"rooted"
],
[
"tree",
"tree"
],
[
"logarithmic",
"logarithmic"
]
],
"raw_glosses": [
"(computer science) A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"wikipedia": [
"Daniel Dominic Sleator",
"Robert Endre Tarjan"
]
}
],
"word": "link/cut tree"
}
{
"etymology_text": "Invented by Daniel Dominic Sleator and Robert Endre Tarjan in 1982.",
"forms": [
{
"form": "link/cut trees",
"tags": [
"plural"
]
},
{
"form": "link cut tree",
"tags": [
"alternative"
]
}
],
"head_templates": [
{
"args": {
"head": "link/cut tree"
},
"expansion": "link/cut tree (plural link/cut 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",
"English terms spelled with /",
"English terms with redundant head parameter",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time."
],
"links": [
[
"computer science",
"computer science"
],
[
"data structure",
"data structure"
],
[
"forest",
"forest"
],
[
"rooted",
"rooted"
],
[
"tree",
"tree"
],
[
"logarithmic",
"logarithmic"
]
],
"raw_glosses": [
"(computer science) A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"wikipedia": [
"Daniel Dominic Sleator",
"Robert Endre Tarjan"
]
}
],
"word": "link/cut tree"
}
Download raw JSONL data for link/cut tree meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-02-26 from the enwiktionary dump dated 2025-02-21 using wiktextract (ce0be54 and f2e72e5). 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.