Heap Data Structure | MaxHeap Insertion and Deletion | DSA-One Course #31

[@influencerab5918]

00:01 Heap data structure: Insert and Delete operations
02:27 Heap is a complete binary tree with max/min property
04:50 The heap data structure can be used to find the index of the parent, left child, and right child of any node.
07:25 Insertion in MaxHeap
09:39 Explanation of the insert operation in a heap data structure
12:15 Insert operation in heap
15:00 Understanding the process of heap deletion and keeping the heap structure intact
17:41 Deletion in MaxHeap data structure
20:06 Understanding how insertion and deletion work in a maxHeap
Crafted by Merlin AI.

[@nightcrusader5047]

bhaiya kaafi achee tarike se explain kara hai. A suggestion -> end me recap dediya karo bus chota sa. like todhe pace pe already discussed cheez.

[@AshishKumar-pq6pr]

Bhaiya aap bahot achaa parhate hai..... love you.....bas thora aur frequently videos daalia

[@dharmilshah767]

These videos are really helpful. Please continue making new content on DSA...💖💖

[@jayisampelliwar5246]

//It was helpful video
boolean helpful = true;
While (helpful) {
print ("Yess 🔥");
}
Best teacher ever.
you're the best in world sir no words for you ❤️❤️❤️❤️❤️❤️❤️❤️❤️

[@aasmohammad2651]

Yes not only this video but your each video help a lot Thank you bro....

[@deadlyhollows8434]

Ur tutorials r the best bro

[@chinmaynayak4529]

You are doing a wonderful job bhaiya!!! Please never stop making DSA videos.

[@Rainbow-fe3fi]

can you upload more videos like these frequently if possible. .its a request..this is a very good series..plzzzzzz

[@agyaani8060]

Ha pehle ye course complete kra dijiye acche se bhaiya!

[@bhanwarlal6526]

Yes bro

[@ashokdurunde1814]

These videos are really helpful.
#dsaone
#dsaone#dsaone#dsaone#dsaone#dsaone

[@jai_shree_krishana]

YES BHAIYA, IT WAS VERY VERY HELPFUL, it is also helpful to learning, how to write code on paper and dry run using pen and paper.

[@little-by-little-one-trave1770]

Great content just one optimisation in deletion while loop condition we can write while(i

[@editssinfinity5355]

Bhaiya. Apka teaching style kaafi cool hai. 😊
Linked list kab layenge??

[@kushagra4401]

your explanation is just awesome, thank you anuj bhaiya , waiting for more videos in this series.

[@ankitapushp7407]

Most awaited video...
And it is amazing as always..
Thank you Anuj Bhaiya !!

[@ANKITKUMAR-wn1ub]

Bhaiya me bhaiya
Anuj bhaiya
Btw nice explanation bhaiya 🔥🔥🔥

[@darkfantasy9239]

Thanks bhaiya I have searched many a lot of video but I can't understand but your video is completely understandable for me ❤😊

[@ikvardag3170]

It saved my DSA paper loveee u to the moon bro ❤❤❤

[@ashvinimeshram5242]

Thanks. Your way of explaination is just amazing.it is really helpful🔥🔥🔥🔥🔥

[@bhanwarlal6526]

Bro competitive leke jaana.... Thanks a lot 🙏🌹❤🌹🌹🌹❤❤

[@harshbatham6848]

Bhaiya ye course ko thoda speed up krdo kyuki essa course kahi ni hai YT pe or it's the most important & needed course for us 🙌🙌 PLEASE Request.......
Peace out✌

[@agyaani8060]

Ha pehle ye course complete kra dijiye acche se bhaiya!

[@bhanwarlal6526]

Yes bro

[@premtiwari8960]

Best video then apna college

[@drakesharke2878]

The way you explain concepts is just fantastic. Keep up the good work.

[@RaHuL-fw2rc]

Yes it was helpful.
Thank you so much

[@himanshurajpal7842]

Plse sir be active 🎉
Your content is easy to understand and very good...
I have been doing DSA from ur content ... 🌞

[@syedadnan3246]

Yes,it was helpful ❤

[@iamgourabtalukdar]

Yes, It was Useful 😁

[@grx4.067]

Bhaiya ji aap best ho

[@poojanehra3425]

Yes, it is really helpful Thank you.

[@manvijain8545]

Anuj Bhaiya, you are a gem teacher . Thanks a lot. Keep growing☺☺

[@areeshaanjum3396]

yes. it was really helpful 💖💖

[@krishanudutta2943]

It was amazing you explained it in a easy way thanks....

[@mrityunjayjaiswal3801]

Yes. Awesome explanatiom. better than apna college

[@rpsoniofficial]

Shaandaar 👌

[@codesera9416]

One of the easiest tutorial to understand

[@aarzoo2302]

Such a great teacher, how easily he explained heap .....Thankyou Anuj bhaiyaa💓💓

[@chetashreejagtap7585]

yes, I understand . very nice explanation, thank you anuj bhaiya!

[@gauravgol2211]

Thankyou
The way you explain it's makes very easy to understand
Thankyou bhaiya
Keep teaching us like this 💙💙

[@ishwar274]

Thank you so much anuj bhai 🙏

[@BusinessIdeas-]

when implementing , since array starts from index 0, so parent Index becomes (i-1)/2
so while loop looks like this and will consider i>=1
while(i>=1){
//find parent for new value added at last level
int parentIndex=(i-1)/2;
.........
}

[@darshanpagar1894]

use recursive approach

[@vaibhavsrivastava4645]

Best explanation...
Thanks for the efforts.

[@haroonahmed9835]

Awesome ❤️❤️❤️🙏🙏🙏

[@kartikeshwarhingole6007]

Yes, It is a very nice video

[@jackwalker2947]

Best explanation bhiya🔥

[@vijaymalav8005]

Suppeerrbb bhaiya 💥💥

[@cr7johnChan]

Yes, it was helpful Anuj Bhaiya

[@rishudube2912]

Nice explanation 🔥🔥
Thanks for this video

[@samyakshastri7477]

Yes, it was helpful :)

[@nabilafzal2984]

Amazing Explanation :)

[@sumitrana2628]

💕💕💕💕🤗🤗🤗 great video Anuj bhaiya 🥳🥳🥳🥳🥳

[@RohitKumar-cv5bc]

Tune dekh bhi liya woh bhi 3 min mein. 😂

[@harshitavyas7497]

amazing work

[@ovokteb9671]

Thanks for the amazing explanation

[@mayurkapadnis4265]

Excellent explanation 🙏🙏👍👍

[@55_jyotirmaykar30]

Man, I just Love you♥️

[@rudhramsaraswat1]

it's shows that you are a great teacher.
...nice video.

[@pardhi8959]

YES, HELPFULL ❤

[@ujwalapatil650]

Nice explanation

[@mdnadeem6343]

yes bhaiya its very helpful

[@vamshicholleti8386]

Great explanation

[@kshitijhansa711]

"Yes,It was Helpful"

[@GovindPanchal]

Bhai first viewer all time

[@meetsoni1938]

Yes this video is very helpful

[@Prateek_Mantry]

Thank you Bhaiya.

[@travelnlearn]

very well explained

[@itz_me_imraan02]

This playlist and video quality is 🔥

[@bhanwarlal6526]

Bro competitive lekr jana 🥰

[@virusrecord629]

Awesome video

[@LAVESHGARGPCECS]

Thanku bhaiya ❤️❤️❤️

[@mohannayak4483]

yes, it was helpful , thank you bhaiyya

[@taduribhargavi4112]

Yes,great lecture anuj bhaiya we want more such vedios on this topic and btw you're very good at explaining things..

[@randomperson7009]

Yes, It was helpful

[@laveshgarg2189]

yes ,bhaiya it was helpful

[@pryansh_]

yes, it was helpful
bring more on this topic

[@ramanand6836]

Very helpful . 😍

[@mohit8299]

thanks for the great explnation

[@itz_me_imraan02]

Plz cover all the imp data structures required for faang💚💛

[@nilshr2]

Most Helpful

[@sankalparora9374]

very nice refresher. Thanks!

[@mandar.vaidya]

YES,IT WAS HELPFUL

[@singh.aadarsh]

Superb bro.
This tutorial

[@prafulmandge5210]

Thank you sir... the explanation in the video was so good and easy to understand.... Thanks a lot for such a nice content sir!!!!

[@spyboy07]

yes it was very helpfull

[@cmcatholic1798]

In array implementation of heap do we need an array starting index from ONLY 1?

[@raimuhammadarslan3771]

it was for simplicity

[@ranchocomedy7785]

nice video liked very much

[@danishuddin9752]

yes it was helpful!

[@danishsharma496]

yes it was very helpful

[@mehrabhossain8225]

love from Bangladesh

[@saritaprasad4295]

you are great!

[@AmanGupta-qj9jh]

Easy to understand thanks Anuj brother :)

[@sawanpatel3491]

it was really helpful.

[@sumitpatil6405]

Does doing BCA from upgrade has the same value as conventional BCA??

[@BartBruh]

Love you man

[@nikitajaiswal9112]

Amazing😍

[@mobile-alchemist]

thnks bro, liked ur ved

[@chubbooo]

Liked. Very helpful and interesting way of teaching. I am just trying to find a way of insertion into Max Heap that is different from yours!

[@vishalmishra1937]

best material

[@akashd9161]

03:14 aapke heap hi nahi hai was a personal 😂😂😂😂

[@bhanwarlal6526]

Bhai competitive lekar jao 🥰🥰🥰

[@arch3994]

Aur bhanwar Lal , bhangarh mein bhoot kab aayenge ?

[@priyanandinijain9467]

Thank you Sir

[@syedabdulalishah9195]

Shukria