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

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

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

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

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

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

Simple and easy to under explanation! Thank you!

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.

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

You explained clearly Nd completely understandable

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

thank you so much, Mam. U saved me 😇

Perfect. Thanks for sharing knowledge

U made my day mam.. Love u mam😘

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

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

Crisp and to-the point.

Thanks for such a good tutorial

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

Every thing is clear thank you so much

Thank you mam well teaching . Understand in first time👍

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

Thank you very much mam... very helpful

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

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

Thank You so much Madam! its help me alot

So good I like videos of edu4 channel a lot

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

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

You amke so easy that topic for me thanku mam

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

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

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 ?

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

Clear explanation madam yours thanku

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

Nice Explanation... Thanks..

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

Thank you ma'am love 💖 from ANTARCTICA 😃

thank you so much mam..

I'm interesting to listen more classes

thank you!

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

This is awesome

Thank you mam...👧👧👧👧

Very nice explanation mam👌🙏

Thank you 🤗

Well explained and so clearly

Very nice madam ,I need McQ updated please

very good teaching!

Tq very much

thank a lot!

Madam please tell us about skew heap

thanks a lot.....

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?

Thanks ku sooo much

Tqq mam

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

Nice Explaination mam 💛

Thank u mam...

Thank you ❣️

Thank you

Tq a lot mam

Shouldn't 66 be on the left sub tree?

Thank you so much mam

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

Awesome.....😎

Explain threded binary tree..mam..

Thanku so much mam ji

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

Thanks mam..

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

66 should be on left sub tree

Excelent!

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

What if equal to

Thanks mam

Thank u mam

❤️

can we say heap tree other name is heap order

good explaination.

But mama you didn't explain heap min example

Mam explain leftist heaps

quite goodf

right tree is the biggest the node

ma'am very good nice

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

Vary nic i like and follow u

👍

good one

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

I think there was some confusion

9:37 88 aayega 55 ki jagah

Why u use 55 two time🤨

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

We must have added 55 below 44!!

Mam plzzz upload heap tree deletion

55 ki jagah 88 aayega ma'am

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

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

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