The book I have been following for learning datastructure uses "single-pointer" as arguments in the functions which add new nodes in different positions in a linked list e.g. At the beginnning, at the end. Also in case of deletion "pointer-to-pointer" are used. In all these cases, the function prototype looks like:
void appendordelete (struct node **, int );
But in functions which count no of nodes, display the list and add after a certain position, the function prototype changes to:
void anyofthementionedfunctions (struct node *, int );
So I am confused when should I use single-pointer and when pointer-to-pointer in linkedlist operations. Please clarify. These functions work in a typical and ideal way, so I am not posting the coding for these lengthy functions.