mahesh

• Jun 17th, 2013

 

get two pointer to head of the list. then increment one pointer by two nodes and other by one node. if list is circular at some point both pointers will be pointing to same node. else u will encounter end of the list

Also if list is not circular when end of list is encountered one pointer will be pointing to middle of the list