single linked list ? - then save pointer to next node, start from head and go to the node right before the node being deleted, and change it's "next" pointer to the one you saved. Now you can delete node. double linked list ? - no need to start from head, just reassign pointers in neighbor nodes properly to point to each other instead of to the node being deleted, and then delete the node. Of course, special care for first and last nodes, which have some NULL pointers.