bn:02114337n
Noun Concept
Categories: Trees (data structures), Heaps (data structures), Priority queues
EN
leftist tree  HBLT  Leftish Heap  leftist heap
EN
In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Wikipedia
Wikipedia
Wikidata
Wikipedia Redirections
Wikidata Alias