Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00334916n
Noun Concept
SYL
No term available
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
Relations
Sources
IS A
EN
priority queue
EN
heap
HAS KIND
EN
binary heap
STUDIED BY
EN
graph theory

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