public T remove(T rem)
    {
        LinearNode<T> previous = null;
        LinearNode<T> current = first;
            while (current != null)
            {
                if (current.getElement().compareTo(rem)==Patient.SAME_NAME)
                {
                    count--;
                    System.out.println(current.getElement()+" removed from queue.");
                    T element = current.getElement();

                    if(previous!=null)
                    {
                        previous.setNext(current.getNext());
                    }
                    else
                    {
                        first = current.getNext();
                    }

                    return current.getElement();
                }
                previous = current;
                current = current.getNext();
            }
        return null;
    }

//In Patient

public static int SAME_NAME = 1234567;
@Override
    public int compareTo(Patient o)
    {
        if(this.name.equals(o.getName()))
            return SAME_NAME; //This number if names are equal
        return this.priority - o.getPriority();
    }