https://www.bradcypert.com/tags/trie/ Recent content in Trie on BradCypert.com Hugo en-us Tue, 27 Dec 2022 22:25:45 -0500 https://www.bradcypert.com/a-brief-introduction-to-tries/ Fri, 30 Jun 2017 00:00:00 +0000 https://www.bradcypert.com/a-brief-introduction-to-tries/ <p>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.</p> <p>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 apart into a trie. Each character will be represented as a node.</p>