Category:Trie
Jump to navigation
Jump to search
ordered tree data structure used to store a dynamic set or associative array | |||||||
Upload media | |||||||
Subclass of | |||||||
---|---|---|---|---|---|---|---|
Different from | |||||||
|
Media in category "Trie"
The following 19 files are in this category, out of 19 total.
- 7dwarves.svg 493 × 182; 13 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
- 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
- Pointer implementation of a trie.svg 393 × 415; 8 KB
- Suffix structures diamond.svg 410 × 241; 7 KB
- Trie example with keys 07 and 42.svg 673 × 429; 36 KB
- Trie example.svg 400 × 375; 23 KB
- Trie node with bitmap example.svg 1,069 × 371; 49 KB
- Trie-icon-rounded.svg 512 × 284; 356 bytes
- Trie-vs-minimal-acyclic-fa.svg 500 × 570; 24 KB
- Trie.png 887 × 781; 60 KB
- Trie.svg 334 × 476; 8 KB