k-ary tree (Q3608019)
Jump to navigation
Jump to search
Tree data structure in which each node has at most K children. From a graph theoretical perspective, k-ary trees are actually arborescences.
- k-way tree
Language | Label | Description | Also known as |
---|---|---|---|
English | k-ary tree |
Tree data structure in which each node has at most K children. From a graph theoretical perspective, k-ary trees are actually arborescences. |
|
Statements
Identifiers
1 reference
Sitelinks
Wikipedia(5 entries)
- cawiki Arbre M-ari
- enwiki M-ary tree
- eswiki Árbol k-ario
- itwiki Albero n-ario
- srwiki N-arno stablo