Radix trees are often used in routing tables. On Linux, for IPv4, there is an additional level of compression to avoid the cost of many intermediate nodes. I've

Radix trees are often used in routing tables. On Linux, for IPv4, there is an additional level of compression to avoid the cost of many intermediate nodes. I've described the algorithm used on Linux here: https://vincent.bernat.im/en/blog/2017-ipv4-route-lookup-linux#route-lookup-in-a-trie https://vincent.bernat.im/en/blog/2017-ipv4-route-lookup-lin...