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 answers only
not deleted
user 7076
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
8
votes
Accepted
Trie implementation for left to right wildcard search
from the Trie class. … {
private final Map<Character, Trie> children = new HashMap<Character, Trie>();
private final Set<String> descendantWords = new HashSet<String>();
public Trie() {
}
public void …
- 29.9k