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.
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
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
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
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?
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
This video made me to understand creating heap tree easily. Thanks a lot madam
Thank you mam for solving my doubts.
Tomorrow I have data structures exam now got clarity in the concept of heaps.
Simply awesome 👌 with clear cut explanation mam😊Best way of understanding 🤗
perfect explanation. thank you very much. keep up the good work!
Just found your channel. Thanks for your works ma'am
This is the best channel and also your the best faculty ,,,,,thank u soooo much mam>
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.
she didnt even try to explain what a complete binary tree is lol
Perfect. Thanks for sharing knowledge
so easy and understandable...tnk u so much mam❤
You explained clearly Nd completely understandable
Thank you mam well teaching . Understand in first time👍
U made my day mam.. Love u mam😘
thank you so much, Mam. U saved me 😇
The explanation is very easy for understand the concept....tq mam
Crisp and to-the point.
So good
I like videos of edu4 channel a lot
Thanks for such a good tutorial
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
Every thing is clear thank you so much
I LOVE YOU
you saved my life at 2:26 AM
Thanks so much, two days left for my exam!!
Thank You so much Madam! its help me alot
Thanxxx...mam khbhi class m kuch samjh nahi aaya ....aap bhot sahi samjhate ho❤️👑..........thanxxx....
Thank you very much mam... very helpful
Thank u😊😊
My all doubts are clear now in the concept of heap tree..
🥰🥰🥰
Nice video Ma'am.............concept is very clear......✌🏾✌🏾✌🏾✌🏾✌🏾
You amke so easy that topic for me thanku mam
You explained very clearly ma'am... thankyou so much 🙏
Sharma ji
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 ?
Clear explanation madam yours thanku
Nice Explanation... Thanks..
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
U r helping me in all situations mam. Thank you so much. Tomorrow is my data structure exam. Tq so much
Are you pass or fail
full nahi mila , toh mai ekh danda lekh kar maruunga
@@nagalakshmanraomaridu3388 bro 😂😂😂
@@newgoblin49 sahi bola😂😂
If the value of left child is more than the parent node,how could it be balanced binary tree?
There is a difference between binary tree and binary search tree. (Its balanced property depends on level order.)
If remove the smalest number and end to last node then we use same method?
Having an exam in half an hour,thanks ma'am!
Thank you ma'am love 💖 from ANTARCTICA 😃
This is awesome
I'm interesting to listen more classes
Do you mean you are interesting because you want to listen to more classes? Quite egotistical
thank you!
Well explained and so clearly
Very nice explanation mam👌🙏
Thank you mam...👧👧👧👧
very good teaching!
thank you so much mam..
Very nice madam ,I need McQ updated please
Tq very much
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
Awesome.....😎
Nice Explaination mam 💛
thanks a lot.....
Thank u mam...
Explain threded binary tree..mam..
Madam please tell us about skew heap
66 should be on left sub tree
Thanks mam..
Thank you 🤗
Thank you ❣️
good one
Tq a lot mam
thank a lot!
Thanku so much mam ji
Thank you so much mam
good mam good but some problem that you can not question number
Thanks ku sooo much
Excelent!
Thank you
Thanks mam
good explaination.
Tqq mam
but at last its not binary tree cause 66 is in right node as is less than root node??
Thank u mam
Shouldn't 66 be on the left sub tree?
Mam explain leftist heaps
quite goodf
ma'am very good nice
66 is the smallest value than 88 , 66 is place the left side.?
can we say heap tree other name is heap order
right tree is the biggest the node
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?
why is 33 right child of 55? in the right should go the numbers greater than 55
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
Vary nic i like and follow u
Thank you so much! You are better than my data structures sir
We must have added 55 below 44!!
What if equal to
Mam plzzz upload heap tree deletion
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
Maam ye solve kiasy ho ga
❤️
But mama you didn't explain heap min example
why u insert 55 two times at left and then right?
actually vaha 88 likhna chahiye tha human mistake
Yes
Please make all subject videos in Computer science 3 rd Semester mam
Plesae make all subject in 3rd sem CSE Branch
👍
Nice
9:37 88 aayega 55 ki jagah
Don't know how you people achieve milestones in your life ! being such Nerds
I think there was some confusion
min heap ka question krwaey ...
The example you took isn't the complete binary tree while explain max and min heaps
Why u write 66 at right side as it is less than 88
The first example was not of a complete binary tree...it is neither a binary tree.CHECK