View source for Tries

Trie (or prefix tree) is used to store words in a tree. From the root to the leaves, it forms a word.

To implement a tries, each node should contain a flag that indicates if it is a complete word and a hash-map whose key is the subsequent characters and the value is the node.

== Resources ==
{| class="wikitable"
!
|-
|https://www.youtube.com/watch?v=zIjfhVPRZCg
|}