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.

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

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.

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

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

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

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

Your channel deserves way more subscriptions.

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!!

Best explanation I've found till now

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

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

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

Extremely helpful!! Thank you !! :)

Criminally underrated, thank you!

this is goated, deserves all the likes

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

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

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

Excellent explanation!!!

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!

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

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

So concise. Ugghh, I love it 👍

Thank You!

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

This is so great

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?

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

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.

Thank you!

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

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

Appreciate you man

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

2:19 Whoa, what is this dark magic 😲

well done

Thank you soo much

Next stop 60k!

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

Wow

Why is the title of the video translated into german?

no way I found a video less than 10 minutes

❤❤

He's cute and he's smart.

hi

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