A very very very very very simple linked list implementation. It it will probably not compile at this point, it is incomplete.

LinkedList.cc

#include <iostream>

struct Node {
        int item;
        Node* next;
};

class LinkedList {
    private:
        Node* head;

    public:
        LinkedList() {
            head = NULL;
        }
        ~LinkedList() {
            delete head;
        }

        void insert(int item) {
            //Initialize
            Node* n = new Node;
            n->item = item;
            n->next = NULL;

            if (head == NULL)  //list empty?
                head = n;
            else if (n->item <= head->item)  //1st item?
            {
                n->next = head;
                head = n;
            }
            else //insert in the middle or at the end
            {
                Node* prev = head;
                while (prev->next != NULL && prev->next->item < n->item)//figure out where to go
                    prev = prev->next;
                n->next = prev->next;//insert
                prev->next = n;
            }
        }

        bool remove(int item) {

        }

        friend std::ostream& operator<<(std::ostream& stream,
                                        const LinkedList& list);
};

std::ostream& operator<<(std::ostream& stream, const LinkedList& list) {

}

int main() {

}