C-trie
Appearance
This is an old revision of this page, as edited by 213.159.51.95 (talk) at 06:09, 1 October 2015 (added footer). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
A C-trie is a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility.
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
Search trees (dynamic sets/associative arrays) | |
---|---|
Heaps | |
Tries | |
Spatial data partitioning trees | |
Other trees |