If you've ever tried to implement a linked list or thought about what a linked list is, you'd realise that you don't have direct access to elements, you only have direct access to the next element (and previous for a double threaded linked list).
You access elements with iterators. e.g.
1 2 3 4 5 6 7 8
typedef std::list<wordListType> container;
for (container::iterator p = dic.begin(); p != dic.end(); ++p)
{
wordListType* entry = *p
// use the entry--print wordSize;
std::cout << entry.wordSize << std::endl;
}