Tries are a very useful data structure used in cases where keys can be broken into “characters” and share prefixes with other keys (e.g. strings). With the previous implementations BST and RST Hash Table, we may have the following structures: Key ideas: Every node stores only one letter...