Patricia Trees
Keys are represented by binary strings
To avoid 1-way branching that would happen in a simple binary search trie, include a skip value, which indicates how many bits to skip before examining the next bit at each node
Sometimes called “path compression”