In my experiments, tries easily win out only when comparisons are expensive. Tries struggle against optimized btrees e.g. when you have word-sized integers as the keys.

They do win in simplicity of implementation vs performace. A bog-standard critbit tree with no tricks is almost trivial to implement. Performace wise it stays in the running against anything not heavily optimized.