1: // @author Frank M. Carrano, Timothy M. Henry 2: // @version 5.0 3: public void enqueue(T newEntry) 4: { 5: freeNode.setData(newEntry); 7: if (isNewNodeNeeded()) 8: { 9: // Allocate a new node and insert it after the node that 10: // freeNode references 11: Node newNode = new Node(null, freeNode.getNextNode()); 12: freeNode.setNextNode(newNode); 13: } // end if 15: freeNode = freeNode.getNextNode(); 16: } // end enqueue