Tries In Go (Data Structures and Algorithms – Golang)

Tries in Go – This is the second video of a multi-part series covering data structures and algorithms in Golang

In this programming tutorial I dicussing tries (in Golang). Tries are a tree-like data structure who’s nodes represent a letter of the alphabet. By structuring nodes in a particular way words and strings can be retrieved from the structure by traversing down a branch path of the tree.

Trie implemented using an ARRAY
https://replit.com/@gpark1005/Tries-witharray#main.go

Trie implemented using a MAP
https://replit.com/@gpark1005/Tries-withmap#main.go