Patricia Tree Properties
N-1 internal nodes, N external nodes
search performance insensitive to insertion order, but very sensitive to distribution of digits
assuming random distribution, approx # of digits/bits inspected is about log N, for M-ary trie with N nodes [see Knuth vol3 for the (nontrivial) analysis]