I\'m trying to decide which data structure 开发者_C百科to use for the following. Lets say I have maybe 10 million keys that contain pointers to unique objects containing some data.
I\'m looking for a Radix Tree implement开发者_如何学Cation that I can use for keys that are string of binary characters, actually UUID so must support null byte.
I am attempting to implement a very simple Trie in Java that supports 3 operations.I\'d like it to have an insert method, a has method (ie is a certain word in the trie), and a toString method to retu
加载中,请稍侯......