Heap - Max Heapify

preview_player
Показать описание
In this video, I show you how the Max Heapify algorithm works.
  1. zooce
  2. CSE 310
  3. Data Structure
  4. Algorithm
  5. Data Structures
  6. Algorithms
Рекомендации по теме
Heap - Max 0:06:24

Heap - Max Heapify

Everything you need 0:00:59

Everything you need to know about Heaps (Min Heap / Max Heap Data Structures)

Heap - Build 0:06:10

Heap - Build Max Heap

Heapify Algorithm | 0:16:29

Heapify Algorithm | Max Heapify | Min Heapify

Heap sort in 0:04:13

Heap sort in 4 minutes

Heaps in 6 0:05:56

Heaps in 6 minutes — Methods

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

Insert an element 0:00:20

Insert an element in Max heap with the help of array. #coding #programming #dsa #shorts #trending

Heapify 0:01:19

Heapify

Heap Sort is 0:00:56

Heap Sort is Way Easier Than You Think!

Data Structures: Heaps 0:10:32

Data Structures: Heaps

Heap | Build 0:00:58

Heap | Build #animation

The Heapify Algorithm 0:04:55

The Heapify Algorithm

Binary Max Heap 0:02:00

Binary Max Heap | Heapify

Heaps & Priority 0:24:08

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

Linear Time BuildHeap 0:05:20

Linear Time BuildHeap

#029 [Data Structures] 0:22:36

#029 [Data Structures] - Heap Sort Algorithm(Heapify,Build heap,Max-Min heap) With Implementation

Heaps, heapsort, and 0:19:01

Heaps, heapsort, and priority queues - Inside code

Heaps and Heapsort 0:11:08

Heaps and Heapsort - Simply Explained

7.9 Heap Sort 0:46:03

7.9 Heap Sort | Heapify Method | Build Max Heap Algorithm | Sorting Algorithms

Max-Heapify and Build_Max_Heap 0:19:30

Max-Heapify and Build_Max_Heap Procedure

Algorithms | Sorting 0:37:37

Algorithms | Sorting Techniques | Max heapify algorithm and complete binary tree|Ravindrababu Ravula

Min Heaps and 0:00:59

Min Heaps and Max Heaps and Heapify

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

Thank u god all mighty i couldn't find a SINGLE video to explain this concept quickly and concisely omg!!

AliciaCramel
Автор

I call you "Zeus"
god of the algorithms
ruler of data structures

thanks man.

AlexChambersXYZ
Автор

Thanks buddy, you explained it and made it clearer than my professor who has 2 Phds...

MarsTheProgrammer
Автор

It was hard to find simple and clear explanation of this problem. Thank you.

dariuszd
Автор

This made so much sense! Thank you for explaining it so clearly!

kimberlyjohnson
Автор

I love you so much for creating this video! Saved my life!

HaloElite
Автор

Very well explained video and the visual representation was very well illustrated and broken down into a step-by-step formula that made it even easier to understand, thank you sir! :)

bobbymcgrath
Автор

much love man. my teacher is a 70 years old who it does not care about students. Thanks a lot !

Shobu
Автор

Perfect and simple explanation. Thank you!

botqqq
Автор

I think this guy was sick too..Hats off to you it was a great video

KnownUser
Автор

Brief and understandable explanation! Thank you. :)

Burak-pljl
Автор

Is there a particular reason you traverse the tree starting with the right subtree of 16 first on your tree at 2:00? I thought tree traversals (pre-order, post-order, in-order) put left before right in all cases?

MorleyDev
Автор

Great explanation, helped me a good bit.

MyVanir
Автор

Thank you so much this FINALLY makes sense :))

minkihairoil
Автор

Basically a Khan Academy video. Great job :)

DrakeLuce
Автор

6 minutes of "visualization" is worth more than 6 hours of explanation

RafaelNascimento-qojp
Автор

I dont get it. If this is big O(logN) Everytime you max heap something. You mess up the sub tree below. So you have to go back and max heap it again. Isn't it O(n^2)?

jontran
Автор

yeah i understood but how to make that understandable to computer

VersatileAnthem
Автор

How does the algorithm know when it needs to re-heapify subtrees?

transam
Автор

Which drawing app are you using for lecture?

deepakrout