Deleting for Nodes from a Singly Linked List Head Deleting the head node requires us to keep track of the second node to make sure that we set the head to point to the new first node. tmp = head head = head rightarrow next//set new head to second node in list delete tmp Deleting the tail node is an easy task. We just need to reset the tail to point to the next-to-last node in the list. tmp = head while(tmp rightarrow next != NULL) tmp = tmp rightarrow next//find second to last node in list tmp t = tmp rightarrow next//pointer that points to tail tmp rightarrow next = NULL//make second to last node to be new tail delete tmp1 Deleting a node in the middle of a linked list requires traversing the list and making sure that we link the remaining nodes. If we find the node we want to delete and we delete it, without linking the remaining nodes together, we create a memory leak. It is important to link the preceding and following node with one another before deleting the desired node. We did not write the pseudocode in the previous section because your job for this week's recitation is to write the pseudo code for deleting a node in the middle of the linked list. Once you are done with the pseudo code, use the singly list 3 rightarrow 5 rightarrow 1 rightarrow 10 rightarrow 2 and draw the steps that your pseudo code will go through in order to delete the node at position 4. Show the work to your TA