Algorithms and Data Structures
2019-09-24
Implementing a Trie in Golang
Learn how Trie (prefix tree) data structures work: O(m) search and insertion, applications in HTTP routing and IP lookups, and a Go implementation of insert and search operations.
#Golang#Radix Tree#Trie
