Heaps in 3 minutes - Intro

Introduction to heaps in 3 minutes.
Code: github.com/msa...
Sources:
1. Introduction To Algorithms, Third Edition (CLRS) [www.amazon.com...]
2. www.quora.com/...
3. stackoverflow....
LinkedIn: / michael-sambol

[@MichaelSambol]

In the discussion on height, it's worth noting that nearly complete binary trees are balanced and thus have a height of O(logn). Regular binary trees may become unbalanced, at which point this would no longer apply.

[@de-stressmusic432]

If you count array from 0, left = 2i + 1, right 2i + 2, parent Math.floor(i-1/2)

[@skringli]

Thank you!!! 🙏🙏

[@danieltascu7020]

thanks

[@Shinn-sy6jf]

parent = Math.floor((i-1)/2)

[@jeevesmcqueeves]

Instantly subscribed because it's a breath of fresh air to have a slow-paced (yet short and concise) explanation of a concept. I feel like I have time to actually understand what is being explained.

[@MichaelSambol]

Thank you! 👊🏼

[@FaridTaba]

Came here to comment the exact same thing!! Thank you for not editing out all the pauses 🙏

[@unknownman1]

please don't go away this time. I remember watching your tutorials 4 years back.

[@zeeg1529]

really appreciate the pacing and mentioning heaps for memory management first to avoid confusion. great content!

[@MichaelSambol]

thank you!

[@abhishekmoramganti3471]

You are probably one of the best educators out there man! These types of videos make these concepts way less intimidating to approach.

[@jays.3702]

This is such a fire way to teach coding concepts. Keep it up man

[@jasonleng2490]

Your channel deserves way more subscriptions.

[@kamylamarinho4868]

Hey man, I wanted to thank you, you taught me in a simple and efficient way the subject that my teacher has been teaching for 2 months!!

[@MichaelSambol]

you're welcome!

[@rongitmukherjee]

Best explanation I've found till now

[@eriksoto8512]

what an insanely good video to find while studying and writing notes for a final

[@ChristyTamuno]

Wow

[@usualguy7583]

Really easy to understand and straight to the point. I appreciate the video a lot

[@dameongraham4444]

My gosh man!! You’re amazing!! Keep it coming…🙏🏾🙏🏾

[@MichaelSambol]

More en route!

[@udayrajvadeghar8555]

Extremely helpful!! Thank you !! :)

[@alliesteele6282]

Criminally underrated, thank you!

[@MichaelSambol]

haha thank you! tell your friends

[@antonkomaristyy3562]

this is goated, deserves all the likes

[@MichaelSambol]

Thanks man!

[@paulinaanna5]

i spent 2 hours in a lecture to hear about this concept. I understood your 2 mins explanation better

[@mohammadahmedragab837]

easy to understand ,consice and in the same time detailed and I like your explanation :")

[@meepmoop42]

studying for my data structures final and ur videos are so incredibly helpful :]

[@MichaelSambol]

Nice! Go crush your test 💪🏼❤️

[@MarcoAurelio-sv2tk]

Excellent explanation!!!

[@asif.haswarey]

First off, nice video!
2:18 : Would help visually for you to show the indices (indicated by i in the formulas) in small font next to each of the nodes. For example:
Node 21 : i = 0
Node 17 : i = 1
Node 14 : i = 2
Node 12 : i = 3
Node 8 : i = 4
Node 1 : i = 5
Lastly, using the light-green and cyan-blue colors might be difficult to clearly distinguish for color impaired viewers. But then there's the problem with yellow and light red.
Tritanomaly : Blue/Green, Yellow/Red,
Tritanopia : Blue/Green, Purple/Red, Yellow/Pink
O boy! Nevermind!

[@user-fk1wo2ys3b]

You are a great teacher, what a talent, THANKS!!!

[@MichaelSambol]

Thank you 🫡

[@SirArtorias]

Oh boy, a gift from God, tomorrow is my exam lol

[@servantofthelord8147]

So concise. Ugghh, I love it 👍

[@MichaelSambol]

💪🏼❤️

[@LilJollyJoker]

Thank You!

[@user-wy1br4le3i]

The sound here is scary, almost had a panic attack.

[@macolulu]

This is so great

[@anshikagaur2156]

hey , for left u said its 2*i and the answer comes out index 6 but while considering 2n+1 for left , answer comes out index 7 , why?

[@fernandofa2001]

Your videos are fantastic! But how do you have so few views for all the subscribers you have?

[@MichaelSambol]

thank you!
help me spread the word :)

[@fernandofa2001]

@@MichaelSambol sure thing pal, keep it up!

[@NickWinters]

Why are heaps sometimes called nearly complete binary trees? How is that relevant? I learned that heaps are sorted binary trees. It shouldn't matter if they are nearly or fully complete, or drastically incomplete then. And it's not like all nearly complete binary trees are heaps. I don't understand.

[@ironmonkey1990]

Thank you!

[@NoName-rq6bg]

The MLS clearly has the beat Logos🔥 they look kinda like city or state logos. Logos from the other leagues look too much like school logos

[@mrmansir3734]

Is a max-heap the same as just a heap?

[@renderscott]

I think a "regular" heap is a min-heap

[@zakyoung2374]

Appreciate you man

[@narenbabu629]

What is the intution behind naming the Heap data structure.
What is called a heap in Heap data structure?

[@happilyevernever4289]

heap: an untidy collection of objects placed haphazardly on top of each other.

[@CptColCool]

2:19 Whoa, what is this dark magic 😲

[@colin9112]

well done

[@JvMapote]

Thank you soo much

[@MichaelSambol]

you're welcome 😊

[@D3ebK]

Next stop 60k!

[@xPorkchops007x]

0:30 I thought that was a complete binary tree that is nearly full, not nearly complete

[@goodhuman1]

Wow

[@leonh2140]

Why is the title of the video translated into german?

[@MichaelSambol]

Default should be English. Is it not?

[@voilin]

no way I found a video less than 10 minutes

[@noswag5773]

❤❤

[@MichaelSambol]

💪🏼❤️

[@ecmrn]

He's cute and he's smart.

[@user-ri3yl7sd5l]

hi

[@xxbshiixs]

Currently really angry at him so I thought I‘m going to study a bit and learn about heap.
Yeah I‘m now more angry

[@MichaelSambol]

:(