public void insertWord(String word) {
		//Start at root
		TrieNode curNode = root;
		//loop through each char in the string
		for (char c : word.toCharArray()) {
			//get the index of where the string should be stored in the children array
			int index = getIndex(c);
			//if -1 then the char is invalid
			if (index != -1) {
				/*
				*if the child at that index is null then assign a new TreeNode with
				*the current char and set its parents to the curNode
				*/
				if (curNode.children[index] == null) {
					curNode.children[index] = new TrieNode(c);
					curNode.children[index].parent = curNode;

				}
				/*If the child is not null, set isleaf to false and set curNode to the child*/
				if (curNode.children[index] != null) {
					curNode.isLeaf = false;
					curNode = curNode.children[index];
				}
			}
		}
		//set the curNode as a word = true
		curNode.isWord = true;
	}