🏠CS166

Course
Syllabus Honor Code Exam Logistics
Resources
Mathematical Terms and Identities
Lectures
0. 4/1 Range Minimum Queries, Part I 1. 4/3 Range Minimum Queries, Part II 2. 4/8 Succinct Rank Queries 3. 4/10 Succinct Select Queries 4. 4/15 Hashing and Sketching, Part I 5. 4/17 Hashing and Sketching, Part II 6. 4/22 Balanced Trees, Part I 7. 4/24 Balanced Trees, Part II 8. 4/29 Amortized Analysis 9. 5/1 Binomial Heaps 10. 5/6 Fibonacci Heaps 11. 5/8 Disjoint-Set Forests 12. 5/13 Cuckoo Hashing 13. 5/15 Invertible Bloom Lookup Tables 14. 5/20 Approximate Membership Queries 15. 5/22 Tries and Suffix Trees 16. 5/27 Suffix and LCP Arrays 17. 5/29 Fusion Trees, Part I 18. 6/3 Fusion Trees, Part II
Problem Sets
0. Problem Set 0 1. Problem Set 1 2. Problem Set 2 3. Problem Set 3 4. Problem Set 4 5. Problem Set 5

Tries and Suffix Trees

Thursday May 22

Today we explore two fundamental data structures for working with text - tries (and their variant Patricia tries) and suffix trees.

Links

Condensed Slides.pdf
Lecture Slides.pdf

All course materials © Stanford University 2025.
Website programming by Julie Zelenski with minor edits by Keith Schwarz. This page last updated 2025-May-22.