Lecture 10 Part 2 - Last Dance - Priority Queue & Heap

📌 In This Video: Lecture 10 Part 2 Recap We're a group of students from the Faculty of Computer and Information Sciences at Ain Shams University, and we're here to make your academic journey a little easier. This channel is dedicated to helping fellow students with study guides, lecture breakdowns, and tutorials — created by students, for students. We are not an official university organization - just a passionate group of peers committed to supporting our community. 📬 Stay Connected: 🔔 Subscribe so you never miss a new upload 👍 Like the video if it helped you 💬 Comment your questions below — we read everything! 📨 Email us: [email protected] ⏱️Timestamps: 00:00:00 Intro 00:01:00 Dijskra Left Note 00:03:41 Priority Queue ADT 00:10:41 PQ Implementation 00:17:48 Heap as a Tree 00:20:29 Heap as a Data Structure 00:22:44 Heap Applications 00:24:46 Heap Properties 00:33:40 Why O(log n) 00:40:21 Heap Insertion 00:43:15 Heap Deletion 00:45:52 Heap Peek 00:46:13 Heap Construction 00:50:05 Finally, Some Code 01:14:00 يتم الإمضاء 01:14:30 Outro If this helped you, share it with a classmate who needs it. 🚀 #datastructures #cplusplus #programming #computerscience #coding #softwareengineering #techtutorial #learntocode #codewithme