linked list problem

Posted by progster on Stack Overflow See other posts from Stack Overflow or by progster
Published on 2010-06-06T16:01:23Z Indexed on 2010/06/06 16:12 UTC
Read the original article Hit count: 200

Filed under:
|
|

Delete every 't'th (t>1) node of a single linked list. In the resultant linked list, again delete 't'th node. Repeat this till only t-1 nodes remains.

For this i have come up with: Traverse until you reach 't'th node, delete all the nodes till the end. Is there any efficient way other than this?. Can any one please help me out. Thanks.

© Stack Overflow or respective owner

Related posts about c++

Related posts about c