Algorithms 2

HAI101I Suite, Algorithms 1

Contents:

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

• heap sorting, lower limit on sorting

• simple graph structure: representations (adjacency matrices, edge lists, neighbor lists),
  basic algorithms (connectedness, depth and width traversal, topological sorting), distance calculation (Dijkstra, heap implementation)