Binary Heaps for Priority Queues

preview_player
Показать описание
Table of Contents:

00:00 - Introduction and Prerequisites
00:20 - maxHeaps vs. minHeaps
00:49 - Objects vs. References
01:15 - Priority Queues
01:57 - Operations
02:19 - changeKey
02:40 - delete
03:06 - Problem
04:27 - Options
  1. Algorithms with Attitude
  2. binary heaps
  3. Binary Heap
  4. Priority Queue
  5. david scot taylor
  6. data structure
Рекомендации по теме
Implement A Binary 0:20:19

Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)

2.6.3 Heap - 0:51:08

2.6.3 Heap - Heap Sort - Heapify - Priority Queues

Heaps in 3 0:03:29

Heaps in 3 minutes — Intro

What Is a 0:08:45

What Is a Binary Heap?

Heaps, heapsort, and 0:19:01

Heaps, heapsort, and priority queues - Inside code

Priority Queue Introduction 0:13:18

Priority Queue Introduction

Binary Heaps for 0:06:03

Binary Heaps for Priority Queues

8. Binary Heaps 0:50:52

8. Binary Heaps

Binary Heaps as 0:17:51

Binary Heaps as a Priority Queue

Trees 8 | 0:05:06

Trees 8 | Priority Queue - Binary Heap 2

Tech Talk: Implementing 0:08:30

Tech Talk: Implementing Binary Heaps for Max Priority Queues

Introduction to Priority 0:08:06

Introduction to Priority Queue and Binary Heap in Java

[algorithm] Priority queue: 0:10:34

[algorithm] Priority queue: Binary Heap

Trees 7 | 0:05:19

Trees 7 | Priority Queue - Binary Heap 1

Heaps & Priority 0:15:57

Heaps & Priority Queues in Python

Introduction to Heap 1:11:07

Introduction to Heap Data Structure + Priority Queue + Heapsort Tutorial

Data Structures: Heaps 0:10:32

Data Structures: Heaps

11.6 Priority Queue 0:14:26

11.6 Priority Queue using Heap

Trees 10 | 0:06:33

Trees 10 | Priority Queue - Binary Heap 4

Heapsort and Binary 0:21:31

Heapsort and Binary heaps: Samuel's tutorial

Heaps & Priority 0:24:08

Heaps & Priority Queues - Heapify, Heap Sort, Heapq Library - DSA Course in Python Lecture 9

7.8 Max Heap 0:34:28

7.8 Max Heap Insertion and Deletion | Heap Tree Insertion and Deletion with example| Data Structure

Priority Queue Inserting 0:09:59

Priority Queue Inserting Elements

Heap as a 0:11:41

Heap as a Priority Queue

Комментарии
Автор

Came from the introduction to heaps video, your hair just keeps getting bigger hahaha.

dalvrzx
Автор

That ventriloquism totally cracked me up! haha

VikrantGoelCan
Автор

"Keep your hands off my nodes" Hahahaha you're hilarious!

michaelzeng
Автор

you can't imagine how this was helpful for me, thank you so much

themrkinhos
Автор

I wonder if we can keep a Map<Key, Index> in the heap internally. That way job code doesn't have to know about indices. But I can't think of a solution when two jobs have same keys/priorities.

BeautifulTurkish
Автор

Informative _and_ hilarious?! Consider yourself subscribed!

jimmyjimbo
Автор

uhm i didnt see an example of Min Heap. is it just the opposite max heap?

when should we use max? when for min?

whyjamesisacommonname
Автор

remove your face from the videos, it makes me distracted!

ritwik