Category:Trie
Jump to navigation
Jump to search
ordered tree data structure that organizes nodes by common key prefixes | |||||
Upload media | |||||
Subclass of | |||||
---|---|---|---|---|---|
Has use | |||||
Different from | |||||
| |||||
![]() |
Media in category "Trie"
The following 32 files are in this category, out of 32 total.
-
7dwarves.svg 493 × 182; 13 KB
-
7dwarvesThreaded.svg 525 × 165; 15 KB
-
A diagram of the Aho-Corasick string search algorithm.svg 728 × 1,028; 6 KB
-
Afd.jpg 98 × 137; 4 KB
-
An example of how to find a string in a Patricia trie.png 532 × 366; 26 KB
-
ATCGATCGA$ Suffix Tree.png 1,080 × 645; 16 KB
-
BitwiseTreesScaling.png 791 × 480; 33 KB
-
Burst trie.jpg 2,460 × 1,262; 182 KB
-
Insert 'slower' with a null node into a Patricia trie.png 188 × 211; 8 KB
-
Insert 'test' into a Patricia trie when 'tester' exists.png 360 × 215; 10 KB
-
Insert 'toast' into a Patricia trie with a split and a move.png 548 × 287; 18 KB
-
Inserting the string 'water' into a Patricia trie.png 188 × 136; 6 KB
-
Inserting the word 'team' into a Patricia trie with a split.png 381 × 211; 10 KB
-
Inserção e remoção na árvore PATRICIA.png 1,040 × 548; 25 KB
-
Lulea+Algorithm+Example+of+a+Lulea+Trie.jpg 960 × 720; 53 KB
-
Pointer implementation of a trie.svg 393 × 415; 8 KB
-
Suffix structures diamond.svg 410 × 241; 7 KB
-
Trie 01.jpg 181 × 220; 6 KB
-
Trie example with keys 07 and 42.svg 673 × 429; 36 KB
-
Trie example.png 300 × 286; 14 KB
-
Trie example.svg 400 × 375; 23 KB
-
Trie node with bitmap example.svg 1,069 × 371; 49 KB
-
Trie representation.png 1,053 × 416; 77 KB
-
Trie vs radix tree.svg 612 × 684; 3 KB
-
Trie-icon-rounded.svg 512 × 284; 356 bytes
-
Trie-vs-minimal-acyclic-fa.svg 500 × 570; 24 KB
-
Trie.jpg 98 × 113; 3 KB
-
Trie.png 887 × 781; 60 KB
-
Trie.svg 334 × 476; 8 KB
-
Trie002.png 344 × 155; 4 KB
-
Trie002.svg 333 × 141; 13 KB
-
Y-fast trie.svg 244 × 306; 24 KB