Unit SS, Part A: PAT, Building PAT Trees

• Naive solution: 18n chars
  • 3-4 words/ internal node (2 ptrs)
  • 1 word/ external node (ptr)
• Bucketing of external nodes
• Supernodes of internal tree nodes
• 2-3 disk accesses in index + final access to verify skipped bits