Heap Data Structure | Heap Problems and Solutions | Data Structure | Skillslash

Heap Data Structure | Heap Problems and Solutions | Data Structure | Skillslash
#skillslash #fullstack #tree

In this tutorial, we're discussing a quick overview of Heap and how to delete a node in heap. And also Advanced problems like converting BST to Min Heap and printing Kth greatest in Max Heap.

TOPICS COVERED IN THIS SESSION:
00:07 An overview of Heap
04:32 An example of deleting a node in a heap
12:10 How to delete the node with index
17:13 Logic or Pseudocode
19:25 Explanation of code
30:10 BST to Min Heap
32:22 Print all nodes less than a value x in a Min Heap
41:18 Connect n ropes with minimum cost
53:10 Various logical solving with less cost
01:08:00 Algorithm
01:12:32 Explanation of code
01:21:30 Print Kth greatest in a Max Heap
01:41:07 Assignments
01:44:48 End.

#heap #tree #fullstack #datascience #ai #python

⦿ If you enjoyed this video don't forget to Like, Share and Subscribe to our channel to never miss our videos: https://www.youtube.com/c/Skillslash

-------------------------------------------------------------

⦿ About us:
Skillslash is an ed-tech company driven by IIT KGP Alumni, with the vision to help aspirants and working professionals stride ahead in their careers. We understand the pivotal need for quality programs in ever-trending technologies, hence we offer radical courses in the areas like Analytics, Data Science, Artificial Intelligence, Deep Learning, Machine Learning, etc.

⦿ To know about our courses visit us at: https://www.skillslash.com/

⦿ Connect with us for more on:
○ Instagram: https://www.instagram.com/skillslash_academy/
○ LinkedIn: https://www.linkedin.com/company/skillslash/
○ Facebook: https://www.facebook.com/skillslash.academy/