Return to Revisions

Some thoughts:

1. Your use of the default access level is probably incorrect. Public, private, and sometimes protected make much more sense. In particular, if this class is not to be used outside of its package, you can make the whole class default scope and let the methods be public. If it is to be used outside its package, everything should be public.
2. In java, all variables should start with a lowercase letter except constants. You should also try to pick more descriptive names. There's no real cost to spelling out what a variable holds.
3. Your use of comments is not ideal. Most of what you have should either belong to the the javadoc for the relevant method or it should be obvious based on a better variable name.
4. You're not using standard java brace locations. They belong on the same line.
5. .isWord==true should just be .isWord. You don't need to compare boolean variables to true or false.
6. Helper methods would clean up your API by not forcing clients to pass in the node, 0 and "" with every call.
7. It would be a better separation of concerns if your Dict class only found the words and didn't output them. Let the caller handle that part. It greatly increases the reusability of the class.
8. This may be a bug - addWord is always returning the same node that was passed in. Why bother?

Putting it all together, if I were writing this class, it would look more like this.

import java.util.ArrayList;
import java.util.List;

public final class Dict {
    private static final int ALPHABET_SIZE = 26;
    private static final int LOWERCASE_A_ASCII_VALUE = 97;

    private boolean isWord;
    private final Dict children[] = new Dict[ALPHABET_SIZE];

    public Dict() {
        super();
    }

    public void insertWord(final String word) {
        this.insertWord(this, word.toCharArray(), 0);
    }

    private void insertWord(final Dict node, final char[] letters, final int currentLetterIndex) {
        if (currentLetterIndex == letters.length) {
            node.isWord = true;
            return;
        }

        final int linkno = indexForCharacter(letters[currentLetterIndex]);
        if (node.children[linkno] == null) {
            node.children[linkno] = new Dict();
        }
        this.insertWord(node.children[linkno], letters, currentLetterIndex + 1);
    }

    public List<String> findWords() {
        final List<String> words = new ArrayList<String>();
        this.findWords(this, words, "");
        return words;
    }

    private void findWords(final Dict node, final List<String> words, final String str) {
        for (int i = 0; i < ALPHABET_SIZE; i++) {
            if (node.children[i] == null) {
                continue;
            }
            if (node.children[i].isWord) {
                words.add(str + characterForIndex(i));
            }
            this.findWords(node.children[i], words, str + characterForIndex(i));
        }
    }

    private static int indexForCharacter(final char character) {
        return character - LOWERCASE_A_ASCII_VALUE;
    }

    private static char characterForIndex(final int index) {
        return (char) (index + LOWERCASE_A_ASCII_VALUE);
    }
}