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.
🧡 HELP us by donating on patreon: / techdose
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:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
USEFUL LINKS:
🟠Must do TIPS to ACE Virtual Interview: • 🔴Must do Tips to ACE y...
🟢Best strategy to excel your coding interview: • 🔴Best strategy to exce...
🟡Get your dream job in 1 month: • 🔴Get your dream job in...
🔵How to crack dream job in just 2 months: • How to crack dream job...
🟣7 Days DSA plan: techdose.co.in...
RELATED LINKS:
Power of Heap: • Power of Heap
#heap #heapcourse #techdose

[@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?)

[@glenfernandes5248]

Haha, nice one!

[@agileprogramming7463]

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

[@techdose4u]

Welcome back :)

[@cocoarecords]

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

[@techdose4u]

Making them

[@johnpaulpineda9821]

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

[@techdose4u]

Welcome :)

[@DineshSharma-pp3ox]

This is very very helpful video helps a lot
Thanks 😊

[@gokulnath_n]

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

[@techdose4u]

Sure

[@garvitsharma6401]

+1

[@mdtausifahmed6205]

it is wonderful your an underrated guy

[@mdtajemulislam9732]

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

[@kholiyamails1257]

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 .

[@DineshSharma-pp3ox]

Please be continued for every topic

[@shubhiVerma_]

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

[@techdose4u]

Welcome :)

[@aadarshsingh2265]

Quick and easy explanation

[@kunalsoni7681]

Thank you so much sir for making this ❤️😊

[@techdose4u]

Welcome

[@ashwani6360]

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

[@shreelakshmi6890]

Very clear video..Thanks!

[@techdose4u]

Welcome :)

[@syedmdharris8814]

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

[@techdose4u]

Sure :) stay tuned

[@abolfazlshahidi1360]

perfect

[@songs-pu9bq]

Excellent bro

[@techdose4u]

Thanks 😊

[@kasyapdharanikota8570]

thank you very much , very helpful series .

[@prosenjitghosh2218]

Very good explanation

[@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.

[@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

[@sumitshokeen4065]

Even I have the same doubt.

[@joshuaking1502]

Doubt the max example.

[@justonegoodtrade]

thank you so much !

[@techdose4u]

Welcome 😊

[@kunalsoni7681]

Amazing video 😍☺️😊❤️

[@techdose4u]

Thanks

[@sarthakbhatnagar261]

awesome explanation bro....

[@E__ShameemahamedS-bx2ed]

Thanks

[@techdose4u]

Welcome

[@sakshamp4488]

tysm sir . :)

[@protyaybanerjee5051]

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

[@swethagowda6708]

which editor are you using to explain?

[@hemsagarpatel8992]

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

[@techdose4u]

I am creating that end to end course on RUclips. Currently, I am doing heap. DP and Graph are over. I will make all the topic videos one by one.

[@protyaybanerjee5051]

Which software do you use to whiteboard ?

[@anshumansharma4580]

Sir, What is the difference between almost complete binary tree and complete binary tree?

[@hacker3191000]

Nothing. They're the same thing.

[@prashuchaudhry]

difference between almost complete and complete tree not cleared properly, kinda same concept for both.

[@mihirmodi1936]

Almost Complete Binary Tree: All the leave nodes must be in (last + second last level). [IF: all leave node are on last level then it is not almost complete binary tree] [perfect binary tree can't be almost complete binary tree and vice versa].
Complete Binary Tree: All the leave node can be in (last level) or (last + second last level). [perfect binary tree is always complete binary tree]

[@srijajulakanti6742]

Where is code link ?

[@techdose4u]

In subsequent videos where I have shown heap implementation, you will find the code link.

[@kcvinu]

Explanation is very good but I get distracted by the ugly hand writing. Sorry for that.

[@techdose4u]

I know. No worries. Thanks ☺️

[@YoDempsey]

It's very misleading to say an "almost-complete binary tree" is a "complete binary tree." You should use the terms "full" and "complete," like everyone else does.

[@shivcharansinghrawat4224]

G.O.A.T - G.O.A.T - G.O.A.T

[@vishwassahu]

mu nhi lagana tha...

[@techdose4u]

I will surely take everyone's feedback on this.