public class LinkedSet<T>
{
    private class Node<T>
    {
        private T item;
        private Node<T> next = null;

        public Node(T item, Node<T> next)
        {
            this.item = item;
            this.next = next;
        }
    }

    private Node<T> head = null;
    private int numItems = 0;

    int size()
    {
        return numItems;
    }

    public boolean add(T toAdd)
    {
        if(head == null)
        {
            head = new Node<T>(toAdd, null);
            numItems++;
            return true;
        }

        for(Node<T> checker = head;true;checker = checker.next)
        {
            if(checker.item.equals(toAdd))
            {
                return false;
            }
            else if(checker.next == null)
            {
                checker.next = new Node<T>(toAdd, null);
                numItems++;
                return true;
            }
        }
    }

    public boolean remove(T toRemove)
    {
        if(head == null)
        {
            return false;
        }
        else if(head.item.equals(toRemove))
        {
            if(head.next != null)
            {
                head = head.next;
                numItems--;
                return true;
            }
            else
            {
                head = null;
                numItems--;
                return true;
            }
        }

        for(Node<T> checker = head;true;checker = checker.next)
        {
            if(checker.next == null)
            {
                return false;
            }
            else if(checker.next.item.equals(toRemove))
            {
                checker.next = checker.next.next;
                numItems--;
                return true;
            }
        }
    }

    public boolean contains(T toCheck)
    {
        if(head == null)
        {
            return false;
        }

        for(Node<T> checker = head;true;checker = checker.next)
        {
            if(checker.item.equals(toCheck))
            {
                return true;
            }
            else if(checker.next == null)
            {
                return false;
            }
        }
    }

    public void put()
    {
        if(head == null)
        {
            return;
        }

        String temp = "";

        for(Node<T> checker = head;true;checker = checker.next)
        {
            temp += checker.item.toString() + " ";

            if(checker.next == null)
            {
                System.out.println(temp);
                return;
            }
        }
    }

}