Linked List: Deletion

Task: Remove 30 from this list

class Node { int value; Node next; } Node n = head;              // start at the headwhile (n != null) {         // walk to the end    n = n.next;             // follow one pointer} n.next = prev.next;         // insert: point it onprev.next = n;              // then point prev at itprev.next = prev.next.next; // delete: step over one

What you are watching

Deleting from a linked list does not touch the node being removed. You walk to the node before it and point that one past it, and 30 is gone from the list the moment nothing refers to it. One pointer write, and every other node stays exactly where it was - which on an array would have meant shifting the whole tail left.