Heap Sort Problem (Tamil) | Divide and Conquer

This video is to solve the Heap Sort Problem!
For CSE/IT Students - UNIT 2(Brute Force Method and Divide and Conquer Method)
#heapsort #heap #CS6402

[@timesup4266]

1:00 ! 4 is < 8..So the 8 is placed on right side.

[@Swetha1103]

Crt

[@user-bo9nd5nw1t]

U are awesome i understand this concept clearly

[@madhumithavasudevan3880]

Really very clear and neat explanation understood clearly want more videos

[@pakirisamypakiri7307]

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

[@mickeyyyy8195]

Thank youu mam I'm clear with this topic now.

[@educationsimplified6069]

Great!

[@harishks308]

Thank you mam..very easy to understand🤩🙏

[@tamillovestatus5099]

ungaloda teaching super akka thank you lot🥳🥰

[@loghapriyaa7030]

Thank you. It really helped me today in my exam😇

[@aarthikannan]

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

[@mohammadyusuf1502]

Mam your teaching is Super😊

[@sriramr5432]

It's really good teaching

[@guruvallavan2754]

Very clear explanation ka❤️

[@kavyak5938]

Good Explanation!

[@abdulrazacka2700]

You are good at teaching

[@pksamyambrish-st5lq]

Super mam easy to understand ☺☺

[@a.mohamedkhalidmasood106]

Thank you sister!

[@muthuram7190]

Explain for properly...another method please...

[@ruthishraj2882]

Nice explanation akka

[@binuangela9277]

Nice explanation

[@bijilistatus4705]

Thank you mam

[@39cserekareji.a79]

Super mam...tq

[@loghapriyaa8020]

Thanks😇

[@Lovely-40]

Thankk youu mamm😊🥳Tomorrow is my examm ✨

[@vennilat7786]

Thanks

[@SSS-ky6ig]

Pls teach about the topological sort, insertion of heap

[@nithiyasri.r1467]

Great

[@nithiyasri.r1467]

Great teaching dude🔥

[@thalapathy439]

Theivamey ❤

[@EESAMPATHKUMARR]

Tq mam

[@thuglife817]

Super sis

[@thamaraiselvandindigul4640]

Element 8 en 7 kiila varakudatha

[@boopathipraveen6665]

Transfer and conquer method

[@PraveenKumar-qd7ut]

Minimum heap sort video podunga ❤️

[@sshenbagavalli994]

8 is greater than main root node
Then how it comes in LHS

[@arutselvan2471]

Mam plz upload quick sort

[@baalaan115]

🙏🙏🙏🙏🙏

[@editing_spotu]

Mam quick sort podunga.......

[@SSS-ky6ig]

Pls topological sort teach me

[@SSS-ky6ig]

Insert of heap ordering

[@akasharul7358]

Max heap ok .apa min heap

[@jaikannan6216]

Akka Algorithms um teach pannunga

[@jaikannan6216]

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

[@educationsimplified6069]

Sure!

[@hero993]

hey that is not a complete binary tree because in 2nd level righthand side node has just one child

[@educationsimplified6069]

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.

[@bhavanik2738]

yeah ... look at the 2nd level...it has only one child node

[@fabulous1879]

Binary tree property is max 2 nodes min node is not considered

[@twinthrottlers741]

@@educationsimplified6069 onum puriyala colapuringa

[@adharshs1211]

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

[@user-cq2ye7ek7p]

ur binary tree formation is wrong.how 8 will come under 3 it should come under 7

[@amsofficial___]

Akka unga kai alaka erukku😅😊

[@i2hmusicworld]

👀

[@mohanrajpradeep5562]

Evalo gaji da ne

[@brothersgamingtamil3551]

Pombala porukiii😂

[@dhanush_16]

Adgan gomala

[@viber5101]

NOT PERFECT

[@tamillovestatus5099]

why not perfect
i think you're brain 🧠 is waste