See full binary tree on Wiktionary
{
"forms": [
{
"form": "full binary trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"head": "full binary tree"
},
"expansion": "full binary tree (plural full binary 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": "Computing",
"orig": "en:Computing",
"parents": [
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A binary tree in which each node has exactly two or zero children."
],
"id": "en-full_binary_tree-en-noun-MqOSfbBV",
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"binary tree",
"binary tree"
],
[
"child",
"child"
]
],
"raw_glosses": [
"(mathematics, computing) A binary tree in which each node has exactly two or zero children."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "full binary tree"
}
{
"forms": [
{
"form": "full binary trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"head": "full binary tree"
},
"expansion": "full binary tree (plural full binary 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",
"Pages with 1 entry",
"Pages with entries",
"en:Computing",
"en:Mathematics"
],
"glosses": [
"A binary tree in which each node has exactly two or zero children."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"binary tree",
"binary tree"
],
[
"child",
"child"
]
],
"raw_glosses": [
"(mathematics, computing) A binary tree in which each node has exactly two or zero children."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "full binary tree"
}
Download raw JSONL data for full binary tree meaning in All languages combined (0.9kB)
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.