d-ary heap (Q5203305)

From Wikidata
Jump to: navigation, search
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
  • d-heap
edit
Language Label Description Also known as
English
d-ary heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
  • d-heap

Statements

0 references
0 references
Algorithms
0 references
 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit