Heaps - Bottom Up Construction

[@dylanirt3905]

Where would I be without softspoken indian ladies in my cs career... thanks for the video! still helping students 3 years later.

[@rinkum4u]

Please clarify - for 7 elements you can take 2 batch of 3 each , what about 8 or 9 elements...for n elements how to divide

[@jasperzhou968]

Thanks! That helps me a lot!

[@MingYan-i1e]

Very good explanation. Thank you so much.

[@konscomputertutorials7473]

perfect explanation thanks

[@tofumakesvideos]

nice video, sukhriya!

[@nourhassoun9331]

you're amazing!!

[@alexanchannel]

Shouldn't a parent of a node "i" be situated at floor[ i / 2 ]. While its left child at 2*i and right child at 2*i+1 ?

[@dieTbshow]

Yeah i think so too, for a higher amount of nodes her arrangement wouldnt make any sense to me

[@jacksonbourne]

no, the left child is at 2*i+1, right at 2*1+2. note that your method of finding the parent isnt correct: its (i-1)/2 (assuming integer, this already floors)

[@caspiandrops9888]

simple and beautiful

[@usamaazeem7302]

Mam what if we got 6 elements.. how to divide h1 and h2

[@jeevanjeevan.s2894]

yo just reply how u r doing in life its been 5 years and you havent uploaded. just want to make sure ur good. i am in love with ur voice.

[@OOGWAYnewcp]

simp

[@Mahii_monster]

Mam this is top up heap tree

[@aanisnoor229]

6:44 OP

[@gowthamkm4787]

Not bad...

[@jeevanjeevan.s2894]

I hope I get a girl with a voice as soft as your's.

[@pramodbn4404]

It's wrong

[@jatingupte7690]

reason??

[@namoan1216]

it's true. another way is top down

[@Mahii_monster]

​@@jatingupte7690 it's top up heap tree

[@zip9267]

Too difficult, there are simpler ways to approach this problem

[@awdsgrgde6979]

got any links or suggestions? I kinda have a problem with this.