This approach involves creating a basic Trie data structure using a tree of nodes. Each node represents a character in a word. Starting from a root node, each character of the word is inserted sequentially, with branches representing the progression to subsequent characters. This forms a chain of nodes (linked in a tree-like manner) from the root to the nodes representing complete words. For searching, we traverse these nodes based on the characters of the input word or prefix to check for existence.
Time Complexity: Insert, search, and startsWith operations are O(m), where m is the length of the word/prefix.
Space Complexity: O(26 * n * m) in the worst case, where n is the number of inserted words and m is the average length of the words. Each insertion can potentially add m nodes with 26 possible children each.
1class TrieNode {
2public:
3 TrieNode* children[26];
4 bool isEndOfWord;
5
6 TrieNode() {
7 isEndOfWord = false;
8 for (int i = 0; i < 26; ++i) {
9 children[i] = nullptr;
10 }
11 }
12};
13
14class Trie {
15public:
16 TrieNode* root;
17
18 Trie() {
19 root = new TrieNode();
20 }
21
22 void insert(string word) {
23 TrieNode* node = root;
24 for (char c : word) {
25 int index = c - 'a';
26 if (!node->children[index]) {
27 node->children[index] = new TrieNode();
28 }
29 node = node->children[index];
30 }
31 node->isEndOfWord = true;
32 }
33
34 bool search(string word) {
35 TrieNode* node = root;
36 for (char c : word) {
37 int index = c - 'a';
38 if (!node->children[index]) {
39 return false;
40 }
41 node = node->children[index];
42 }
43 return node->isEndOfWord;
44 }
45
46 bool startsWith(string prefix) {
47 TrieNode* node = root;
48 for (char c : prefix) {
49 int index = c - 'a';
50 if (!node->children[index]) {
51 return false;
52 }
53 node = node->children[index];
54 }
55 return true;
56 }
57};This C++ implementation uses a TrieNode class with a child array for connectivity and an isEndOfWord boolean. The Trie class maintains a root pointer. The insert function navigates through each character's node in string word, creating nodes as needed, and marks the node of the last character as an end of a word. The search function checks character by character and ensures the final node is marked as an end of a word. Similarly, startsWith checks for the path defined by prefix characters, confirming node existence up to the prefix's final node.
This approach relies on maps (or hashmaps) for storing children nodes dynamically. The advantage of using maps over arrays in this context arises from reduced space consumption when handling sparse trees since only existing characters are stored. Nodes manage their children using hash references, leading to more flexible branching.
Time Complexity: O(m) per operation where m is the word/prefix length.
Space Complexity: O(n * m), where n estimates the word count and m accounts for varying lengths since nodes only maintain necessary mappings.
1class TrieNode {
2 constructor() {
3 this.children = new Map();
4 this.isEndOfWord = false;
5 }
6}
7
8class Trie {
9 constructor() {
10 this.root = new TrieNode();
11 }
12
13 insert(word) {
14 let node = this.root;
15 for (let char of word) {
16 if (!node.children.has(char)) {
17 node.children.set(char, new TrieNode());
18 }
19 node = node.children.get(char);
20 }
21 node.isEndOfWord = true;
22 }
23
24 search(word) {
25 let node = this.root;
26 for (let char of word) {
27 if (!node.children.has(char)) {
28 return false;
29 }
30 node = node.children.get(char);
31 }
32 return node.isEndOfWord;
33 }
34
35 startsWith(prefix) {
36 let node = this.root;
37 for (let char of prefix) {
38 if (!node.children.has(char)) {
39 return false;
40 }
41 node = node.children.get(char);
42 }
43 return true;
44 }
45}The JavaScript version utilizes Map for storing node child references. Map is advantageous with its guaranteed key storability and inherent ordering. The insert method tracks through characters, setting or accessing nodes on the fly with hashmap properties. Searching evaluates characters' existence in path while confirming final node's end-markers during search. Prefix check seeks each character similarly ensuring entire path viability.