[Data Structure] Tries (w/ Explanation and Code)

Link to webpage: https://www.srcmake.com/home/tries Link to github: https://github.com/srcmake/tries A Trie is a tree data structure that stores sequences in a way such that overlapping elements (in the same position) can share the same node. ​For example, "apple" and "apply" are two distinct sequences of characters, but they both share the initial sequence "appl". In this video, we'll go over how you build a Trie with pseudocode, and go through the operations you perform on a Trie, drawing out each step. We'll also review the full C++ implementation. Twitter: https://twitter.com/srcmake Twitch: https://www.twitch.tv/srcmake Discord: https://discord.gg/q5vAET3