Image source: https://www.interviewcake.com/concept/java/trie
The time intricacy of looking, embeddings, and erasing from a trie relies upon the length of the word a that is being looked for, embedded, or erased, and the quantity of complete words, n, making the runtime of these tasks O(a*n).