Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02114337n
Noun Concept
NL
No term available
EN
In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Wikipedia
Relations
Sources
IS A
priority queue
binaire heap
STUDIED BY
grafentheorie

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