Alright, I've got a nice linked list going on...but I've come to a problem. I created a SLL (singly linked list) and all is good except that I can't figure out how to delete a node from the middle of the list. I figure I would go about it by setting the pNext of the node before the one I wish to delete to the address of the node after the one I wish to delete. However, is there a simple way of getting the previous node in the list without creating a DLL (doubly-linked list) or would I just be better off doing the extra work to make a DLL? I figure I could work in some static variables or so that I could store the soon-to-be deleted node's address in and then restart the traversing of the list until pNext is the address of the node I am deleting, but that's a pain. Any ideas or suggestions are appreciated. Just hoping some of you out there with linked list experience might have come across this and have a fabulous solution. Thanks in advance!