Umm, So whats a Trie?

• A “trie” is a tree that is constructed by digitally decomposing the keys that it stores

• So if we want to look up 'foam' we would start at the root and follow the 'f' branch

• Assuming there is an 'f' branch we would then follow the 'o' branch,

• We would repeat the process for 'a' and 'm'

• If the final node is marked as accepting then we have a match