My understanding is that in order to delete a node in singly linked list, we need access to the current node and previous node. I have the following logic for it: My understanding is that in order to delete a n
My understanding is that in order to delete a node in singly linked list, we need access to the current node and previous node. I have the following logic for it: My understanding is that in order to delete a n