Hello
Im not sure if I understood the question, but by definition, a list can just insert a node anywhere in the middle of the list. So if you had a pointer pointing to some location in the middle of the node, if you inserted a node somwhere in the middle, your count for the location of where the pointer was in the list would automatically become invalid. The best thing to avoid complication would be to iterate thru the list from the head. You can have a look at the code for the list functions, its the toolbox.c file in the same folder as the toolbox fp. It'll gie you a better idea of how the list functions are working.
I hope this helps
Bilal Durrani
NI
Bilal Durrani
NI