Data Structures in Golang - The trie data structure

Video Description

Hello, this is a video for the data structures and algorithms series in Golang, where I talk about tries. If you wish to support me 🤗 : buymeacoffee.com/jamie_dev You will learn what tries are, and also learn about how they work. Tries are one of the basic tree structures and it’s also asked in coding interview questions. You can see these kind of problems on Leetcode or Hackerrank, which would be something you'll know about if you want to work in software engineering or computer science. Like always, I’ll be explaining the basic concepts first with diagrams, and then, after that we can go do some coding on tries in golang. 00:00 Introduction 00:19 What are Tries? 00:44 Applications - autocomplete 01:01 Components of Tries 01:34 What does a Node look like? 02:48 Inserting a word in a trie 04:10 Searching a word in a trie 05:05 Time complexity of a trie 06:11 Coding - the big picture 07:05 Coding the structure of Nodes and Tries 11:58 Insert Method 17:43 Search Method 22:23 Goodbye!