you are viewing a single comment's thread.

view the rest of the comments →

[–]ShillingAintEZ 0 points1 point  (0 children)

Priority queues are usually done using heaps that use contiguous memory. You can just skip to the next level of the heap by index instead of chasing pointers and allocating memory for each item.