For the linked list implementation, the constructor would
simply set the head pointer to null
In some situations, you will also want a second list data
member, called tail, to keep track of the end of the list
This is important when you want to frequently add to the
end of the list
Why doesnt a tail pointer help when removing the last
item?