k-ary tree (Q3608019)

From Wikidata
(Redirected from Q6173762)
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
edit
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.
  • k-way tree

Statements

Identifiers

 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit