Data Structures and Algorithms B

Introduction
Stable Marrage
Huffman Codes
- ABL
- Implementation
Graph Algorithms
Divide and Conquer
Dynamic Programming
- Interval Scheduling
- Knapsack Problem
Network Flow
String Algorithms
Randomized Algorithms
- Bloom Filters
  Implementation

Powered by GitBook

Suffix Trees

A suffix tree is just a tuned up trie.

PreviousKnuth-Morris-Pratt NextNaive Implementation

Last updated 4 years ago

On this page

Was this helpful?