java - Implementing a compressed trie tree "add" function -


i'm trying write compressed trie tree code in java , i'm not sure how start implementing "compress" of tree.

my node class consist of array of size 27 , string.

public class trienode {     trienode [] array;     string data; } 

should write regular trie create function compresses nodes?


Comments

Popular posts from this blog

c# - Better 64-bit byte array hash -

webrtc - Which ICE candidate am I using and why? -

php - Zend Framework / Skeleton-Application / Composer install issue -