Give an algorithm for determining, just by link hopping, whether a doubly linked list with header and trailer
sentinels is empty (that is, do not make use of a size member variable).
* My approach to this question is first to create a linked list with templates and then use an array to do this "link hopping". Can someone help me explain how to do this? *
didn't you already make a thread like this?
well if head->link -> tail and/or tail->link -> head then the list is empty