Delving into tree-based heaps, heapify operations, and their application as Priority Queues in scheduling and data compression.
Implementing and understanding the properties of min-heaps and max-heaps.
Building a heap from an arbitrary array in linear time.
Applying priority queues for lossless data compression.