-
Notifications
You must be signed in to change notification settings - Fork 0
/
Trie.java
56 lines (46 loc) · 1.38 KB
/
Trie.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package com.aman.data_structures;
public class Trie {
private TrieNode root;
public Trie(){
root = new TrieNode(); // root is empty
}
private class TrieNode{
private TrieNode[] children;
private boolean isWord;
public TrieNode(){
this.children = new TrieNode[26]; // storing letters : a -- > z
this.isWord = false;
}
}
public void insert(String word){
if(word == null || word.isEmpty()){
throw new IllegalArgumentException("Invalid input");
}
word = word.toLowerCase();
TrieNode current = root;
for(int i = 0; i < word.length(); i++){
char c = word.charAt(i);
int index = c - 'a';
if(current.children[index] == null){
TrieNode node = new TrieNode();
current.children[index] = node;
current = node;
}
else{
current = current.children[index];
}
}
current.isWord = true;
}
// public boolean search(String word){
// return false;
// }
public static void main(String[] args) {
Trie trie = new Trie();
trie.insert("cat");
trie.insert("cab");
trie.insert("son");
trie.insert("so");
System.out.println("Values inserted successfully !!!");
}
}