Linked list problem
quest: find midlle element of a linked list in one traversal.
I have one soln. but i dnt think that goes in one traversal
while(sec->next != NULL)
As when we are checking sec->next we are accessing linked list . and by incrementing first=first->next we are also traversing LL . so its not parrallel working not a single traversal
Any other soln.
-- Android Development Center
-- Cloud Development Project Center
-- HTML5 Development Center
-- Windows Mobile Development Center