Concepts of Heap | Understanding heap

This video explains the concepts required to understand heap data structure.In this video, I have explained perfect binary binary tree along with almost complete binary tree.Both these come under the complete binary tree category. I have explained what data structure is called a heap.There are three requirements. Data structure should be a tree data structure and it should a complete binary tree along with that, it should also follow the heap property.I have also explained the types of heap along with heap property using examples.I have also shown how to identify a heap.At the end, I have named some special heaps which are not required for placements.

CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:

=======================================================================
USEFUL LINKS:

RELATED LINKS:

#heap #heapcourse #techdose

[cocoarecords]

love this you should make it a series for some data structures!

[agileprogramming]

Feels great to be back on TECH DOSE after so long. Aweeesome content as always !!!

[Somethingsomethinglol]

Bro - This is easily the best DS&A channel I have come across. Much better than courses I've paid for. Thank you! (if there was a max heap of all the DS&A channels, yours would be the root - nomsayin?)

[johnpaulpineda]

Your explanation is a very big help to me. You made it easy for me to understand the concept of Heap. Thanks a lot!

[mdtausifahmed]

it is wonderful your an underrated guy

[DineshSharma-ppox]

This is very very helpful video helps a lot
Thanks 😊

[mdtajemulislam]

Saved a lot of time. Thanks for uploading. Love from Bangladesh... ❤❤❤❤❤❤

[gokulnath_n]

Clearly understood ✨....need a series for all ds

[kholiyamails]

bro you are amazing i am just starting to learn i wish i will be able to write high level heap optimized code by your videos .

[famueduyou]

Is almost perfect binary tree is similar to valid AVL? At least when considering the first condition mentioned at 2:40, which sounds like a balance factor of max -1, 0, +1 in AVL.

[shubhiVerma_]

You explained it so so well.... Thank you.. 😊😊😊😊

[kunalsoni]

Thank you so much sir for making this ❤️😊

[swethagowda]

which editor are you using to explain?

[DRK_one_day_vlogs]

Sir the tress u drawn in explanation of min and max are binary tress but it not follows binary tree properties as bcz 100, 300, 10 in min heap example is left side of root 1 which is not a property of binary tress as presents right side

[kasyapdharanikota]

thank you very much, very helpful series .

[syedmdharris]

Thanks buddy, Concept was explained clearly!, Waiting to see how to implement

[protyaybanerjee]

Every Perfect BT is a Complete BT, but not all Complete BT are Perfect BT. Is the understanding correct ?

[ashwani]

if level starts with zero, then we can say that no. of nodes should be 2^n, where n is the level

[hemsagarpatel]

HI sir, do u have any end 2 end course anywhere like udemy or anywhere???

[protyaybanerjee]

Which software do you use to whiteboard ?