Keyword Tree / Trie data structure implementation

Правка en1, от netflix, 2018-01-02 09:43:09

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 ?

Pointers Implementation Code

Arrays Implementation Code

Happy Coding !

Теги trie, pointers

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский netflix 2018-01-02 09:43:09 476 Initial revision (published)