Traversing...Circular LLL
•
How would circular linked lists compare
with singly and doubly for traversal
•
Do we still have to check for null? why?
•
What should the stopping condition be
for traversal?
–
if (!head) //no items in list
–
else while (current->data != match) {
–
prev=current;
–
current = current->next;
–
if (current == head) break; }
