Tries In Go (Data Structures and Algorithms - Golang)

preview_player
Показать описание
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

Trie implemented using a MAP
Рекомендации по теме
Комментарии
Автор

Thank you for taking your time to create these videos! Much love from Nigeria

Dan-rhtn
Автор

dude, you rock ! thank you for helping to go community grow ... i am officially a gopher now

koulbaboy
Автор

Nice video, please share more about data structure and may be some about golang microservice 👍

NotNow
Автор

no need in getNode as struct will get zero values for its fields: false for bool and nil for pointers

sfsdeniso
Автор

Please make your next video on concurrency in go? I really need to see practical examples of it

bradley
join shbcf.ru