Reading list

• Balanced search trees (Sedgewick, pp. 215)
  • 2-3-4 trees
  • red-black trees
• Data compression
  • Huffman encoding (Sedgewick, pp. 322)
  • Lempel-Ziv compression (class notes)
• Hashing (Sedgewick, pp. 231)
• Priority queues and heapsort (Sedgewick, pp. 145)
• Shortest path algorithms
  • Single source shortest path (Sedgewick, pp. 461)
• Minimum cost spanning trees
  • Prim's algorithm (Sedgewick, pp. 452)
  • Approximating an optimal travelling salesperson route (class notes)
• Graph traversals and applications
  • Depth first search (Sedgewick, pp. 472)
  • Cycle detection in digraphs (c.f. Sedgewick, pp. 427)
• Quicksort (Sedgewick, pp. 115)