Trie Implementation. Help please

Правка en2, от Secret.Codes, 2017-08-17 06:37:07

There are two famous way for implementing trie.

One is by linked list and other is by 2D array.

Now I want to know which will be better.

I think 2D array is better for time but it needs too much space than linked list.

Please someone explain time and space complexity of those 2 approach.

If there are any better approach then tell.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Secret.Codes 2017-08-17 06:37:07 25
en1 Английский Secret.Codes 2017-08-17 06:36:01 371 Initial revision (published)