Whenever I solve a question using the Keyword Tree / Trie data-structure, I implement it using pointers. But I have seen many programmers implementing trie using arrays.
What are the downsides of using the Pointers implementation (if at all) , as compared to the Arrays implementation ?
Happy Coding !