Algorithms 2

Sequel to HAI101I, Algorithms 1

Contents:

• tree data structures: binary trees, heaps, ABR, priority queues

• Sorting by piles, lower boundary for sorting

• Simple graph structures: representations (adjacency matrices, edge lists, neighbor lists),
  basic algorithms (connectivity, depth-first and breadth-first traversals, topological sort), distance calculation (Dijkstra, implementation using heaps)