We might be able to optimize the trie to minimize the pointer chasing and thereby improve lookup performance.

Alternatively, we could consider using a hashmap instead of the trie but we would have to consider the pros and cons here.