We've already seen several data structures that can support these
operations (create n, insert, delete, find).
- unsorted list
- sorted list
- binary search tree
- balanced binary search tree
- splay tree (worst case per op)
- splay tree (amortized)
Next: Similar Applications
Up: SPELL CHECKING
Previous: Dictionary