# Introduction to Templates

Unless specified, you do not need to write copy or move constructors
or assignment operators for classes in this unit (however, if
default versions exist but don't make sense, you should delete
them).

Practice:

 1. ‹unrolled› – an unrolled linked list
 2. ‹bintree›  – a binary search tree with insert & lookup
 3. ‹trie›     – a trie data structure
 4. ‹btrie›    – a trie with bitvector keys
 5. ‹queue›    – bounded queue with a compile-time size
 6. ‹stride›   – an iterator for spans in column/row major order