is there anyway to move back my pointer in a link list?
lets say i have my j pointer on the third node and k pointer on the second, i can move j pointer to second node but for further back movement i need some pointer on the first node as well which is not possible in every case.
I am doing this for insertion sorting via link list.
It is very common to have double linked lists, meaning each node contains pointer to both the next and the previous node. If you have that you can easily go back and forth in the list.
I don't think what you want to do can be done with a singly-linked list. However, I am still learning C++ and trying to understand doubly-linked lists so take my opinion with several grains of salt.
I am looking forward to comments by experience programmers.