This is a JSFiddle assignment and must be completed at jsfiddle.net and include

Question

This is a JSFiddle assignment and must be completed at jsfiddle.net and include both the HTML and Java sections

Implement a TRIE that has both the functions AddToTRIE and CheckSpelling.

Once you have created the TRIE add the words (hard code) I, in, into, inlet, inn, inner, innate, ink. These are good words to use to test your TRIE

Create an interface that has one text box for entry and 2 buttons - Add To Dictionary and Spell Check. They should ad the word to the TRIE (feedback - word added) and check the word against the TRIE and return in the word was in or not in the dictionary.

Explanation / Answer

import java.io.*;
import java.util.*;

class TrieNode {
char c;
HashMap<Character, TrieNode> children = new HashMap<Character, TrieNode>();
boolean isLeaf;

public TrieNode() {}

public TrieNode(char c){
this.c = c;
}
}
public class Trie {

// Every trie will have a root node
private TrieNode root;

public Trie() {
// Creating a new trie means creating a new root
root = new TrieNode();
}

public static void main(String [] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
System.out.println("How many strings you wish to add ?");
int n = Integer.parseInt(br.readLine());

//Lets make a new trie
Trie trie = new Trie();

while(--n >= 0) {
String input = br.readLine();
trie.insert(input);
}
System.out.println("Enter the string you want to search");
String needle = br.readLine();
System.out.println(trie.search(needle));
}

// Inserts a word into the trie.
public void insert(String word) {
HashMap<Character, TrieNode> children = root.children;

for(int i=0; i<word.length(); i++){
char c = word.charAt(i);

TrieNode t;
if(children.containsKey(c)){
t = children.get(c);
}else{
t = new TrieNode(c);
children.put(c, t);
}

children = t.children;

//set leaf node
if(i==word.length()-1)
t.isLeaf = true;
}
System.out.println("Inserted : "+word);
}

// Returns if the word is in the trie.
public boolean search(String word) {
TrieNode t = searchNode(word);

if(t != null && t.isLeaf)
return true;
else
return false;
}

// Returns if there is any word in the trie
// that starts with the given prefix.
public boolean startsWith(String prefix) {
if(searchNode(prefix) == null)
return false;
else
return true;
}

public TrieNode searchNode(String str) {
Map<Character, TrieNode> children = root.children;
TrieNode t = null;
for(int i=0; i<str.length(); i++){
char c = str.charAt(i);
if(children.containsKey(c)){
t = children.get(c);
children = t.children;
}else{
return null;
}
}
return t;
}
}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.