Spell checker program using TRIE data structure. Dictionary source is from Dictionary.txt, which is to be in the same directory of the program, or else change the file name and location //Possible.java import java.io.*; import java.util.*; class TrieNode { char letter; TrieNode[] links; boolean fullWord; TrieNode(char letter, boolean fullWord) { this.letter = letter; links = new TrieNode[26]; this.fullWord = fullWord; } } public class Possible { static TrieNode createTree() { return(new TrieNode('', false)); } static void insertWord(TrieNode root, String word) { int offset = 9...