Skip to main content


Implementing Binary Heaps for Max Priority Queues

In this video, Damon Ye discusses how to use heaps and queues together to implement a priority queue. In this meme filled talk, Damon first takes a high level overview of priority queues, the data structures and abstract data types involved, and the benefits of their use. Then Damon takes a deep "dive"(pun that you won't get till after video) into the implementation in JavaScript.

Project Members: Damon Ye

Find the program that fits your life.

Learn about our coding, cybersecurity, and data analytics bootcamps offered on full-time and part-time schedules.