[algogeeks] concatenation of 2 circular linked lists

Hi, I came across this statement that using circular lists, concatenation can be done without traversing either list. The same case with freeing the entire list. Can someone elaborate on this ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group.

Re: [algogeeks] concatenation of 2 circular linked lists

Concatenation of two lists without traversing even one of the lists completely requires a pointer to the last element of the first list (first, as in the one that is to be attached in front of the other list). This is only possible if either, there's a *last *pointer for the lists, or the list is