Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00334916n
Noun Concept
Categories: Heaps (data structures)
EN
d-ary heap  d-heap  D heap  Ternary heap
EN
The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2. Wikipedia
Definitions
Relations
Sources
EN
The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2. Wikipedia
IS A
priority queue
heap
HAS KIND
binary heap
STUDIED BY
graph theory
Wikipedia
EN
d-ary heap
Wikidata
EN
d-ary heap
Wikipedia Redirections
EN
D-heap, D heap, Ternary heap
Wikidata Alias
EN
d-heap

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License