Part 5 | Priority queues, union-find and data compression

• Objectives
• To read
• Exercises A
  • Quick-Find Trace
  • Weighted Quick-Union Trace
  • Valid Weighted Quick-Union Trees
  • Binary Max-Heap Insertions
  • Binary Max-Heap Deletions
  • Priority Queue: Binary Heap vs. Sorted List
  • Heap Tree Traversals
  • True/False: Binary Heaps
  • Linear-Time Bottom-Up Heap Construction
  • Building a Huffman Tree: Priority Queue vs. Sorting
  • Huffman Compression and Decompression Pipeline
  • Binary Heap Push
  • Global Warming with Union-Find
  • Huffman Tree
  • Manual Exercise on Union-Find
  • Manual Exercise on Heaps
• Exercises B
  • Huffman Header: Serialized Trie vs. Codeword Table
  • Repeated Huffman Compression
  • Huffman Compression Ratio and Run-Length Encoding
  • Linked Heap
  • Min-Max Heap
  • MedianHeap
  • Ternary Heap