Heaps and Priority Queues
Master of Engineering (MEng) · University · Computer Science
This unit introduces the heap data structure, its operations, and applications. It also covers priority queues and their implementation using heaps, providing a solid foundation for understanding and utilizing these essential data structures in computer science.
What's included
- Definition and properties of heaps
- Heap operations: insertion
- deletion
- heapify
- Priority queue implementation using heaps
- Time complexity analysis of heap operations
- Applications of heaps and priority queues
Keywords
- Heaps
- Priority Queues
- Data Structures
- Computer Science
- Applications
- Operations
- Implementation