✨ Add Radix Tree Implementation

[Kalkwst]

A radix tree, also known as a Patricia trie, is a type of tree data structure that is used to efficiently store and retrieve data that is represented as strings. It organizes data in a hierarchical structure, where each node represents a single character in a string, and the edges between nodes represent the characters in the string. It is particularly useful for storing a large number of strings, as it allows for efficient search, insertion, and deletion operations, as well as finding the longest prefix match of a given string.

From a more technical perspective, a radix tree is a tree-like data structure used to store a set of strings. It's a trie where each node represents a character in a string, and the edges between nodes represent the characters in the string. The tree is organized in such a way that common prefixes of the strings are grouped together, which allows for efficient search, insertion, and deletion operations. The time complexity for these operations is O(k) where k is the length of the string, which is faster than other data structures like a hash table or binary search tree. It also allows for finding the longest prefix match of a given string in O(k) time complexity. The radix tree is particularly useful for storing a large number of strings, such as IP addresses, DNS names, or phone numbers, in a way that allows for efficient search, insertion, and deletion operations.