Implement Trie (Prefix Tree) Following the protocol and implement a trie with insert, search, and startWith methods.
Write code in Swift language
Step 1: Declare class Trie with two variables children and storeword.
Step 2: Define function subTrie(). Get the first character. Check whether it is existing. Repeat the same for the remaining characters in the word.
Step 3: Define function insert(). Get the first character and initialize storeWord to true. If the character is existing, then get the subTrie. Otherwise, create new Trie.
Step 4: Insert as child in the trie.
Step 5: Define search() function. If the word exists in the trie, then return true. Otherwise, return false.
Step 6: Define startsWith() function. If the prefix exists in the trie, then return true. Otherwise, return false.
Step 7: Create an instance of trie. Invoke insert(), search() and startsWith() functions and display the values returned.
Step by step
Solved in 4 steps with 4 images
