Using pointers to remove item from singly-linked list

by

At the beginning, you do

pp = &list_head;

and, as you traverse the list, you advance this “cursor” with

pp = &(*pp)->next;

This way, you always keep track of the point where “you come from” and can modify the pointer living there.

So when you find the entry to be deleted, you can just do

*pp = entry->next

This way, you take care of all 3 cases Afaq mentions in another answer, effectively eliminating the NULL check on prev.

More Related Contents:

  1. What is the reason for using a double pointer when adding a node in a linked list?
  2. Rationale behind the container_of macro in linux/list.h
  3. C array pointer increment
  4. Convert double * to double [9] in C [closed]
  5. Why this program is crashing?
  6. C pointer to another struct
  7. Segmentation fault using scanf() [closed]
  8. Is an array name a pointer?
  9. Using the equality operator == to compare two strings for equality in C [duplicate]
  10. printf(“%p”) and casting to (void *)
  11. Exceptions to array decaying into a pointer?
  12. Why do arrays in C decay to pointers?
  13. Passing a 2D array of structs
  14. Why a pointer + 1 add 4 actually
  15. Pointers as function arguments in C
  16. What is the result of NULL + int?
  17. Difference between char* var; and char *var;? [duplicate]
  18. Returning pointer from a function
  19. casting char[][] to char** causes segfault?
  20. Literal string initializer for a character array
  21. Does Function pointer make the program slow?
  22. Simple swap function…why doesn’t this one swap?
  23. C isn’t that hard: void ( *( *f[] ) () ) ()
  24. What’s the difference between array and &array?
  25. Pointer expressions: **ptr++, *++*ptr and ++**ptr use
  26. How to sort a linked list using bubble-sort?
  27. When is it valid to access a pointer to a “dead” object?
  28. How to check if a pointer is freed already in C?
  29. Returning a struct pointer
  30. Casting void pointers

Leave a Comment