linked list traversal

Deepak Inbasekaran · 05-16-2007, 01:27 AM

i need to traverse a singly linked list only once but i should end up splitting that list into 2 linked lists with exactly half the nodes of the old one and incase of odd number of nodes, i got to add it at the end of first list itself

wjevans_7d1@yahoo.co · 05-16-2007, 12:51 PM

Judging by your posting history, this is homework.

You'll get more out of your programming class if you do the work yourself.

graemef · 05-16-2007, 05:20 PM

Just to help, if your restriction is that you can only traverse the list once then the split will not be at the half way point but; first, third, fifth nodes (etc) in new list one and even nodes to new list two.

That's the design, now the coding should be a good exercise for you.

Deepak Inbasekaran · 05-16-2007, 10:33 PM

thanks guys, anyway i worked out a logic somehow
i keep traversing the list with 2 pointers, One of them goes 2 nodes each time,the second one goes at 1 node each time till the end of the list NULL comes out

and btw am not doing any home work

am working in a software company n i needed this logic for a small part of a giant code base [

]