How do I implement a queue from a single linked list?

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
 
package assignment1;
 
 
public class LinkedList {
    
    // Make variables private
 
    private Node head;
    private int listCount;
 
        // Constructor for the class
    
        public LinkedList()
        {
                // this is an empty list, so the reference to the head node
                // is set to a new node with no data
                head = new Node(null);
                listCount = 0;
        }
 
        // This method appends the word to the end of this list or in between two words in doing so making the list alphabetic
        
        public void add(Word data)
 
        {
                Node temp = new Node(data);
                Node current = head;
                
                // Crawl to the end of the list, starting from the head node
 
                while(current.getNext() != null && current.getNext().getData().getWord().compareTo(data.getWord())<0)
                {
                        current = current.getNext();
                }
                
                // Make the new node's reference equal to the last node's "next" reference 
 
                temp.setNext(current.getNext());
                current.setNext(temp);
                
                // Increment the number of word objects in the list
                
                listCount++;
        }
 
        // Inserts the word at the specified position in this list.        
        
        public void add(Word data, int index)
 
        {
                Node temp = new Node(data);
                Node current = head;
                // crawl to the requested index or the last element in the list,
                // whichever comes first
                for(int i = 1; i < index && current.getNext() != null; i++)
                {
                        current = current.getNext();
                }
                // set the new node's next-node reference to this node's next-node reference
                temp.setNext(current.getNext());
                // now set this node's next-node reference to the new node
                current.setNext(temp);
                listCount++;// increment the number of elements variable
        }
 
        public Word get(int index)
        // post: returns the element at the specified position in this list.
        {
                // index must be 1 or higher
                if(index <= 0)
                        return null;
 
                Node current = head.getNext();
                for(int i = 1; i < index; i++)
                {
                        if(current.getNext() == null)
                                return null;
 
                        current = current.getNext();
                }
                return current.getData();
        }
 
        public boolean remove(int index)
        // post: removes the element at the specified position in this list.
        {
                // if the index is out of range, exit
                if(index < 1 || index > size())
                        return false;
 
                Node current = head;
                for(int i = 1; i < index; i++)
                {
                        if(current.getNext() == null)
                                return false;
 
                        current = current.getNext();
                }
                current.setNext(current.getNext().getNext());
                listCount--; // decrement the number of elements variable
                return true;
        }
 
        public int size()
        // post: returns the number of elements in this list.
        {
                return listCount;
        }
 
        public Word returnWord(String user_word){
 
            Word word = new Word();
            Node current = head.getNext();
 
            for(int i = 1; i < listCount; i++)
            {
                    current = current.getNext();
 
                    if(current.getData().getWord().compareTo(user_word) == 0){
 
                    break;
 
                    }
 
            }
 
            return current.getData();
 
        }
 
        public boolean checkWord(String user_word){
 
            Word word = new Word();
            Node current = head.getNext();
            boolean answer = false;
            int i = 1;
 
            if(listCount != 0){
 
                current = current.getNext();
 
                do
                {
                        current = current.getNext();
 
                        if(current.getData().getWord().compareTo(user_word) == 0){
 
                            answer = true;
 
                        }
 
                        else{
 
                            answer = false;
 
                        }
 
                }while(i < listCount);
            }
 
            return answer;
 
        }
 
        private class Node
        {
                // reference to the next node in the chain,
                // or null if there isn't one.
                Node next;
                // data carried by this node.
                // could be of any type you need.
                Word data;
 
 
                // Node constructor
                public Node(Word _data)
                {
                        next = null;
                        data = _data;
                }
 
                // another Node constructor if we want to
                // specify the node to point to.
                public Node(Word _data, Node _next)
                {
                        next = _next;
                        data = _data;
                }
 
                // these methods should be self-explanatory
                public Word getData()
                {
                        return data;
                }
 
                public void setData(Word _data)
                {
                        data = _data;
                }
 
                public Node getNext()
                {
                        return next;
                }
 
                public void setNext(Node _next)
                {
                        next = _next;
                }
        }
 
 
}

                                  

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
54:
55:
56:
57:
58:
59:
60:
61:
62:
63:
64:
65:
66:
67:
68:
69:
70:
71:
72:
73:
74:
75:
76:
77:
78:
79:
80:
81:
82:
83:
84:
85:
86:
87:
88:
89:
90:
91:
92:
93:
94:
95:
96:
97:
98:
99:
100:
101:
102:
103:
104:
105:
106:
107:
108:
109:
110:
111:
112:
113:
114:
115:
116:
117:
118:
119:
120:
121:
122:
123:
124:
125:
126:
127:
128:
129:
130:
131:
132:
133:
134:
135:
136:
137:
138:
139:
140:
141:
142:
143:
144:
145:
146:
147:
148:
149:
150:
151:
152:
153:
154:
155:
156:
157:
158:
159:
160:
161:
162:
163:
164:
165:
166:
167:
168:
169:
170:
171:
172:
173:
174:
175:
176:
177:
178:
179:
180:
181:
182:
183:
184:
185:
186:
187:
188:
189:
190:
191:
192:
193:
194:
195:
196:
197:
198:
199:
200:
201:
202:
203:
204:
205:
206:
207:
208:
209:
210:
211:
212:
213:
214:
215:
216:
217:
218: