A Brief Introduction to Tries
Published: 6/30/2017
Hello there! Welcome back! Today I’m talking about Tries (pronounced “trys”). Tries are a type of search tree commonly used for storing and searching single characters that make up one or more strings. What make a trie interesting is that the first node contains an empty value and the descendants of a node have a common prefix associated with that node. Like most data structures, tries are easier to reason about when you have a picture to help explain it. Let’s take the word “propane” break it…