>
> Hi,
>
This one is rather easy.Same approach can be taken here what applies to non
circular linked list.
1. Take a single pointer and a counter. Increment the counter till the next
of pointer points to head of circular linked list.
Reset the temp pointer to head and increment it to counter/2 + 1.If
counter is even then there will be two elements for middle
counter/2, counter/2 +1.
2.Take two temp pointers. Increment first by one and second by two
positions. print the value of first when second reached the head.
You have to put some checks for corner conditions.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
