In a trie, each trie node might have multiple branches. So there is a data structure used to point to next nodes in branches. The data structure to store child nodes can be an array, a linked list or a hash map.