| 
|
Quote: a diamond deque is a simple, symmetric, pointer-free data structure that combines a min-heap with a max-heap
topics >
all references >
references c-d >
Group:
data structures
Quotation Skeleton
A simple pointer-free data structure is proposed to … in one linear array. The simple parent-child relationship … Priority dequeue operations on a diamond deque are … is highly symmetrical, its interface relations between min-heap … Google-1 Google-2
Copyright clearance needed for quotation.
Group: data structures (12 topics, 275 quotes)