hi! in my opinion we can find the middle element in the singly linked which
hv the cycle........
as we know the list doesnt support the concept of cycle coz it has only one
direction traversal........
> but if we take the case when the list hvng the no of element equal
>
as we hv :
n element in the list
we hv to find the middle one
in genral;;;;;simply we divide it in .........
n/2; or
if consider middle elment as a key ;;;;
temp->link=null;
temp->first=middle
--
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.
