Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with trie
Search options questions only
not deleted
user 49420
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
8
votes
2
answers
6k
views
Java Trie Implementation
I am creating a Trie class in Java, and am wondering what else can be done to make it even better. I am hoping to add concurrency to speed querying up. … public class Trie {
private HashMap<Character, HashMap> root;
private final Character END_CHARACTER = '$';
public Trie() {
initializeRoot();
}
public Trie(String s) { …
- 879