public boolean findWord (String word) {
		if (word == null || word.length() == 0) {
			return false;
		}
		TrieTree curNode = this;
		int pos;
		char c;
		for (int i = 0; i < word.length(); i++) {
			c = word.charAt(i);
			pos = c - 'a';
			if (curNode.child[pos] == null) {
				return false;
			} else {
				curNode = curNode.child[pos];
			}
		}
		return curNode.isWord;
	}