In this video, we'll delve into the fundamentals of the heap data structure, explore priority queues, and walk you through a comprehensive heapsort tutorial. Whether you're preparing for a coding interview or just eager to expand your data structure knowledge, this tutorial covers theory, practical coding examples, and an in-depth look at how it all comes together.
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Lecture code: replit.com/@KunalsReplit/Heaps-1
- Complete Java DSA playlist: • Java + DSA + Interview...
- Code, Assignments, & Notes: github.com/kunal-kushwaha/DSA...
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
➡️ Connect with me: kunalkushwaha.com
👨💻 Join WeMakeDevs: wemakedevs.org
======================================================================
Timestamps:
0:00:00 Introduction
0:01:58 Why heaps?
0:10:02 How heaps work
0:21:40 Inserting items in a heap
0:28:20 Removing items from a heap
0:35:15 Code
0:50:32 Heapsort
0:55:45 Priority Queue
0:58:03 Creating a heap from an unsorted array
1:09:14 Closing remarks
#heap #placement #dsa #computerscience #faang
Негізгі бет Ғылым және технология Introduction to Heap Data Structure + Priority Queue + Heapsort Tutorial
Пікірлер: 272