I have a bst which contain words(Strings), what I'm trying to is do an
inorder traversal so as I can print the words in alphabetical order. The
system.out.println() prints them ok, but what I really want it to do is
return a LinkedQueue from my bst, but it only seems to add the very root
of the tree.

Any ideas where I'm going wrong here?

public LinkedQueue flatten(BstNode x){ // x = root node
        LinkedQueue words = new LinkedQueue();   
        if(x != null){
            flatten(x.getLeft());    // traverse the left subtree
            words.qAdd(x.getData());
            System.out.println(x.getData());
            flatten(x.getRight());    // traverse the right subtree
        }   
        return words;       
}

Thanks,
Chris