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 9520
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
1
vote
1
answer
3k
views
Sorted trie implementation in C
*parent;
Trie *marker;
};
Trie *Trie_createNode(const char key, void *data) {
Trie *t = NULL;
t = (Trie *)malloc(sizeof(Trie));
if (! … *key, void *data) {
Trie *t = NULL;
Trie *current = NULL;
Trie *tmp = NULL;
if (! …
- 4,531
13
votes
1
answer
6k
views
Simple trie implementation in JavaScript
I did give the "leaves" of the trie a name property, which is the full key. … Trie structure
Each node in the trie can have a key, a value, a next node, and a child node. In this diagram, each node is represented by a circle. …
- 4,531