A compressed trie merges nodes with one subtree such that each node has at least two subtrees.

Another example: Compact representation of compressed trie

The above example is from "Data Structures and Algorithms in Java"; Sixth Edition; Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser; 2014; Wiley.