Leetcode Q208: Implement Trie (Prefix Tree)

In this tutorial I will explain how to implement the Prefix Tree data structure (also known as a Trie). This data structure is especially useful for programs which require efficient string lookup methods, such as spellcheckers and autocomplete.