Heap tree | Min & Max heap | Data Structures | Lec-45 | Bhanu Priya

Heap tree insertion, min heap & Maximum heap with example

[@nrupatunga5951]

This video made me to understand creating heap tree easily. Thanks a lot madam

[@trueindian03]

Thank you mam for solving my doubts.
Tomorrow I have data structures exam now got clarity in the concept of heaps.

[@srinivasy7499]

A full binary tree (sometimes proper binary tree or 2-tree) is a tree in which every node other than the leaves has two children.
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

[@bronsonschnitzel7493]

she didnt even try to explain what a complete binary tree is lol

[@wilsonvidyutdoloy]

When u added 37 on the left on 40. It didn't remain complete binary tree. Complete binary tree has either 0 child or exactly 2 children. And 40 has only 1 child now i.e 37

[@rajeshbuddiga8672]

Simply awesome 👌 with clear cut explanation mam😊Best way of understanding 🤗

[@saddaramsubbareddy2949]

This is the best channel and also your the best faculty ,,,,,thank u soooo much mam>

[@gappergob6169]

Just found your channel. Thanks for your works ma'am

[@Foodshortswithsk]

If the value of left child is more than the parent node,how could it be balanced binary tree?

[@abhishekk.3977]

There is a difference between binary tree and binary search tree. (Its balanced property depends on level order.)

[@MohanKumar-hu7qm]

The explanation is very easy for understand the concept....tq mam

[@oybekabdulazizov419]

perfect explanation. thank you very much. keep up the good work!

[@purplegalaxy5265]

Simple and easy to under explanation! Thank you!

[@raghadsalem1473]

I LOVE YOU
you saved my life at 2:26 AM

[@muffymypup1871]

I think i ll do myself. Bcuz its not like wherever u can insert the element. If the no . Is greater than root node only then it goes to right side not as if b.t. is filled at lefr

[@vigneshjawahar4822]

U r helping me in all situations mam. Thank you so much. Tomorrow is my data structure exam. Tq so much

[@nagalakshmanraomaridu3388]

Are you pass or fail

[@newgoblin49]

full nahi mila , toh mai ekh danda lekh kar maruunga

[@Amankumar-hh1pk]

@@nagalakshmanraomaridu3388 bro 😂😂😂

[@Amankumar-hh1pk]

@@newgoblin49 sahi bola😂😂

[@williamdevanand2594]

You explained clearly Nd completely understandable

[@NaveedKhanYousafzai47]

Thank You so much Madam! its help me alot

[@saddaramsubbareddy2949]

Thanks sooooo much mam! your explanation is osm ........dai;y am following your channel mam,also please do videos in computer science engineering subject mam,it helps to the people

[@rashikasharma9199]

You explained very clearly ma'am... thankyou so much 🙏

[@raosahabb]

Sharma ji

[@mustafamohammadi5741]

Perfect. Thanks for sharing knowledge

[@balabharathiv429]

Thank you mam well teaching . Understand in first time👍

[@bhuvanadhanikonda9754]

U made my day mam.. Love u mam😘

[@muskankaushal1705]

Thank u😊😊
My all doubts are clear now in the concept of heap tree..

[@sanatan._.dharma_6304]

🥰🥰🥰

[@sarwarjahan05]

Thanks for such a good tutorial

[@A11-RECORD]

Thanxxx...mam khbhi class m kuch samjh nahi aaya ....aap bhot sahi samjhate ho❤️👑..........thanxxx....

[@manasaparlour6923]

Mam sorry to say but there is ah small mistake in your example at the time 9:32 u have given an example as 66 but u had written there 55 once please check it mam

[@piyush22412]

Ryt I also observed it,
but i understood the concept...

[@royalty2497]

Yes bro there is a mistake

[@miraahamed3606]

so easy and understandable...tnk u so much mam❤

[@xXEmilXx100]

Thanks so much, two days left for my exam!!

[@HassanKhan-og7dv]

66 should be on left sub tree

[@srijandixit1224]

Nice video Ma'am.............concept is very clear......✌🏾✌🏾✌🏾✌🏾✌🏾

[@saipavan8669]

Hi Mam, I have seen this video, i have one doubt.
Doubt:
I think left side values needs to lesser than parent and right side values needs to greater that parent right mam. but your explanation node only should greater than left or right side elements is this correct mam?

[@RKTeluguPranks]

I'm interesting to listen more classes

[@nix99problems]

Do you mean you are interesting because you want to listen to more classes? Quite egotistical

[@d3t4ix43]

why is 33 right child of 55? in the right should go the numbers greater than 55

[@xXEmilXx100]

But it's binary tree not a binary SEARCH tree so in a binary tree you can insert smaller values as you like as it follows the heap structure

[@d_c_y_1]

thank you so much, Mam. U saved me 😇

[@fabulousfive3569]

9:37 88 aayega 55 ki jagah

[@sylvesterfernandes8277]

Don't know how you people achieve milestones in your life ! being such Nerds

[@surya.maheshkolisetty1997]

Thank you ma'am love 💖 from ANTARCTICA 😃

[@rafiqmustafa2651]

Every thing is clear thank you so much

[@fahmidaakter3314]

thank you so much mam..

[@arsalhumayun1412]

why u insert 55 two times at left and then right?

[@hardikyewale5291]

actually vaha 88 likhna chahiye tha human mistake

[@RONANKI]

Yes

[@jokerlooser9600]

66 is the smallest value than 88 , 66 is place the left side.?

[@chandrashekar-ei2zg]

So good
I like videos of edu4 channel a lot

[@RKTeluguPranks]

Tq very much

[@mudassirshaikh222]

Thank you very much mam... very helpful

[@gangayadhavan]

Very nice madam ,I need McQ updated please

[@shanmugapriyanr9049]

Thank you 🤗

[@gokulbadrappan3272]

Having an exam in half an hour,thanks ma'am!

[@nivedyavnambiar1909]

Thank you mam...👧👧👧👧

[@karugondasimhachalam4967]

Thank you

[@mudassir5536]

Construct heap tree for following list of numbers.20,10,30,50,60,20,35,40,50,25,80 &
perform heap sort. Keep in mind the max priority queue and Heapify algorithm in mind.
Write pseudocode and algorithm of each

[@mudassir5536]

Maam ye solve kiasy ho ga

[@janvinaik5072]

but at last its not binary tree cause 66 is in right node as is less than root node??

[@labeatognadjaezechiel5558]

I have a concern about the min Heap insertion in the cas we twice a number in the list of items. For exemple 2 , 3, 2, 6 ,1 here we have the number "2" twice . how to do the min heap insertion in this cas ?

[@the____echoes]

Parent node is not equal to Root node at all ! P.S. The definition of Heap tree is incorrect ma’am ! It should be parent node not the root node . Peace -deV

[@rupalishirkande6163]

Very nice explanation mam👌🙏

[@ankitkumarx]

Crisp and to-the point.

[@chinnayuvaraja9074]

Mam explain leftist heaps

[@TheLegend-ml3ep]

If remove the smalest number and end to last node then we use same method?

[@vanireddy2784]

The example you took isn't the complete binary tree while explain max and min heaps

[@Sudhanshu-es6lz]

Well explained and so clearly

[@asfiyakazi916]

Nice Explaination mam 💛

[@user-qs7dp6yb2x]

This is awesome

[@crazypeople6666]

Why u write 66 at right side as it is less than 88

[@sanatan._.dharma_6304]

Thanks mam🙏🙏😍😍🥰🥰🥰

[@reenasharma908]

You amke so easy that topic for me thanku mam

[@theerangelcitizen5655]

Shouldn't 66 be on the left sub tree?

[@-Vamsiadithya]

Thanks ku sooo much

[@MariiaKlochko]

thank a lot!

[@sachidanandapallai6016]

quite goodf

[@nghnino]

very good teaching!

[@dancewithhimani]

We must have added 55 below 44!!

[@chetannain4867]

good explaination.

[@revathiaddala3214]

Clear explanation madam yours thanku

[@PGDCASujataVardhan]

Tqq mam

[@shubhojeetghosh2557]

The first example was not of a complete binary tree...it is neither a binary tree.CHECK

[@priteshkumar659]

thank you!

[@friendsfandom]

What if equal to

[@theboss2809]

Thank you so much! You are better than my data structures sir

[@RathourShubham]

Nice Explanation... Thanks..

[@Sunlight_121]

Thank you ❣️

[@irfanullahkhan7179]

good mam good but some problem that you can not question number

[@singhvicky1605]

Why u use 55 two time🤨

[@sas9730]

Thank you so much mam

[@LearningSkills3]

can we say heap tree other name is heap order

[@Codingworld24]

right tree is the biggest the node

[@LearningSkills3]

ma'am very good nice

[@shafiqahmad5165]

Vary nic i like and follow u

[@kiranvarma149]

explanation good but heap not following binary tree any example it is just a balanced tree.

[@ankitathakur5989]

Thanku so much mam ji

[@sarathkrishnanpv9341]

❤️

[@swapnaswapna61]

But mama you didn't explain heap min example

[@aloksahu1787]

Awesome.....😎

[@subhamchatterjee7697]

it is not a complete binary tree
the level has to be completed

[@JB-dv6yx]

I think there was some confusion

[@harinimudapaka5339]

Madam please tell us about skew heap

[@Gkgamingcenter]

Thanks mam..

[@sridinesh6108]

Thank u mam

[@saddaramsubbareddy2949]

Please make all subject videos in Computer science 3 rd Semester mam
Plesae make all subject in 3rd sem CSE Branch

[@bhupinderkaur5916]

mam this is not a binary tree

[@ayanbhowmik4444]

thanks a lot.....

[@rrr9904]

Mam plzzz upload heap tree deletion

[@vishal3288]

Thanks mam

[@jagadeeshkandula4358]

Thank u mam...