Tries are a type of tree data structure used to store and locate specific keys from within a set. Each node in the trie defines the key associated with it, and all children of a node have a common prefix of the string associated with that parent node. Tries can be keyed by character strings or any other underlying type, such as binary data. Specialized implementations are used to reduce the space requirement of a trie.
Princeton University
Spring 2023
This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness.
No concepts data
+ 25 more concepts