String[] dictionary = {"a", "an", "and", "andy", "bo", "body", "bodyguard", "some", "someday", "goodluck", "joke"};
Trie trie = new Trie();
String[] ndict = randomize(dictionary);
trie.buildTree(ndict);
trie.checkAndIndexLevel();
trie.printMe();
Node deepest = trie.getDeepestNode();
assertNotNull(deepest);
System.out.println("deepest word: " + deepest.getFullWord() + ", level: " + deepest.getLevel());
}