Suppose we have a reference to a node in a singly linked list that is guaranteed notto
Chapter 3, Problem 3.36(choose chapter or problem)
Suppose we have a reference to a node in a singly linked list that is guaranteed notto be the last node in the list. We do not have references to any other nodes (exceptby following links). Describe an O(1) algorithm that logically removes the valuestored in such a node from the linked list, maintaining the integrity of the linkedlist. (Hint: Involve the next node.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer