Hash trie - Data Structures

In computer science, hash trie refers to two kinds of data structure:

  • A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.)
  • An ordinary trie used to store hash values, for example, in an implementation of a hash tree.
  • A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates"

All rights reserved © 2020 Wisdom IT Services India Pvt. Ltd DMCA.com Protection Status

Data Structures Topics