Circular List

Circular Lists A circular list is one in which the last node is followed by the first node: Circular lists are usually preferable to non-circular ones, for two reasons: They provide easy access to both ends of a list: notice that we do not need the first pointer in the header, because we can easily reach the first node with L->last->next the... Read more »

September 24, 2012 at IST / Language, Software Development.