YoVDO

Priority Queues with an Interlude on Heaps

Offered By: YouTube

Tags

Algorithms and Data Structures Courses Algorithms Courses Data Structures Courses Priority Queues Courses Heaps Courses

Course Description

Overview

Dive into the world of Priority Queues (PQs) and explore their implementation using Heaps in this informative 30-minute lecture. Learn the fundamental concepts of Priority Queues, including the differences between Min Heaps and Max Heaps. Discover the techniques for inserting and removing elements from Priority Queues efficiently. Gain practical insights by examining Priority Queue code implementations, enhancing your understanding of these essential data structures and their applications in computer science and algorithm design.

Syllabus

Priority Queue Introduction.
Priority Queue Min Heaps and Max Heaps.
Priority Queue Inserting Elements.
Priority Queue Removing Elements.
Priority Queue Code.


Taught by

WilliamFiset

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera