GenericQueue.java

import java.util.ArrayList;
import java.util.Iterator;
//import GenericList.Node;

public class GenericQueue<T> extends GenericList<T> {
	
	private Node<T> tail; 
	
	//Overloaded constructor for add. It has to be done per guidelines
	public void add(T data, int code) {
        Node<T> node = new Node<>(data, code, null); // constructor sets next = null

        if (getHead() == null) {
            // empty list → make this node the head
            // requires the protected helper inside GenericList
            setHeadNode(node);
            setLength(1);
            tail = node;
            return;
        }
        
        
        Node<T> current = getHead();
        while (current.getNext() != null) {
            current = current.getNext();
        }
        current.setNext(node);
        tail = node;

        setLength(getLength() + 1);
    }

	// Adds new element to the end of queue (data)
	public void enqueue(T data) {
		add(data);
	}
	
	// Adds new element to the end of queue (data, code)
	public void enqueue(T data, int code) {
		add(data, code);
	}
	
	// Deletes element from the end of list
	public T dequeue() {
		return delete();
	}
	
	// Returns last element in queue
	public Node<T> getTail() {
		Node<T> current = getHead();
		
		if (current == null) {
			return null;
		}
		while(current.getNext() != null) {
			current = current.getNext();
		}
		
		
		return current;
	}
	

	@Override
	public Iterator<T> iterator() {
		return null;
	}
	
	
	
	
}