A heap is a complete binary tree, and the binary tree is a tree in which the node can have the utmost two children. A complete binary tree is a binary tree in which all the levels except the last level, i.e., leaf node, should be completely filled, and all the nodes should be left-justified
1:00 ! 4 is < 8..So the 8 is placed on right side.
Crt
I really understood this topic!!...Thank you mam..I want u to post many videos like this🌟and mam teach the sorting with algorithms also...
It is very clear... I understand very clearly thank uu so much..
Really very clear and neat explanation understood clearly want more videos
Anyone see the video 2024 on 14 July 😅
Me 😅with 2x speed 😅
😂
me at 12:01(AM) on 15/07/2024 😅
@@nitrogamerng9468 12.12 😂
@@ahamedaminulislam8658 any ways all the best bro
ungaloda teaching super akka thank you lot🥳🥰
Thank youu mam I'm clear with this topic now.
Great!
U are awesome i understand this concept clearly
Thank you mam..very easy to understand🤩🙏
Thank you... Nice explanation ❤
Mam your teaching is Super😊
You are good at teaching
Good Explanation!
It's really good teaching
A heap is a complete binary tree, and the binary tree is a tree in which the node can have the utmost
two children. A complete binary tree is a binary tree in which all the levels except the last level,
i.e., leaf node, should be completely filled, and all the nodes should be left-justified
Explain for properly...another method please...
Super mam easy to understand ☺☺
Thankk youu mamm😊🥳Tomorrow is my examm ✨
Thank you sister!
Very clear explanation ka❤️
Element 8 en 7 kiila varakudatha
Nice explanation akka
Thank you mam
Minimum heap sort video podunga ❤️
Pls teach about the topological sort, insertion of heap
Great
Theivamey ❤
Great teaching dude🔥
Mam quick sort podunga.......
Thanks
Thanks😇
Nice explanation
8 is greater than main root node
Then how it comes in LHS
Super mam...tq
Entha number venalum potalama mam
Super sis
Transfer and conquer method
Mam plz upload quick sort
Tq mam
Insert of heap ordering
30 July exam 😢
Me too all the best
ur binary tree formation is wrong.how 8 will come under 3 it should come under 7
Pls topological sort teach me
Max heap ok .apa min heap
🙏🙏🙏🙏🙏
Akka unga kai alaka erukku😅😊
👀
Evalo gaji da ne
Pombala porukiii😂
Adgan gomala
Gajiii guru ah 😅😅😢..
Akka Algorithms um teach pannunga
Not only heap sort. Merge,quick,prim's, krushkal's ,floyd's,warshall's also because problems are easy to solve problem Algorithms are Tough to write
Sure!
hey that is not a complete binary tree because in 2nd level righthand side node has just one child
We should not consider the last level. For a complete binary tree, all levels should have two child nodes(left and right) except the last level.
yeah ... look at the 2nd level...it has only one child node
Binary tree property is max 2 nodes min node is not considered
@@educationsimplified6069 onum puriyala colapuringa
@@twinthrottlers741 bro complete binary tree is in the order to fill the elements from left to right and that should be expect the last level
24 July🤡
NOT PERFECT
why not perfect
i think you're brain 🧠 is waste