K-ary tree
- Wikidata
- https://www.wikidata.org/wiki/Q3608019
- OpenAlex ID
- https://openalex.org/C100560664 (API record)
- OpenAlex Description
- Tree data structure in which each node has at most K children. From a graph theoretical perspective, k-ary trees are actually arborescences.
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Gomory–Hu tree
- Optimal binary search tree
- Range tree
- Self-balancing binary search tree
- k-minimum spanning tree
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.