Linked Structures

Delete by Value

Find the node before the target value and rewire its next pointer so the target node leaves the chain.

Algorithm

The replay labels nodes by value, such as node(20), and never exposes object identity or memory addresses. This Dart DSA implementation uses the same small chain as the rest of the DSA track.

predecessor Deletion needs the node before the one being removed.
rewiring The predecessor skips the target and points at the target's next node.

Basic Implementation

basic.dart
Replay: real traced execution (multi-file project)
class Node {
  int value;
  Node? next;
  Node(this.value, [this.next]);
}

String render(Node? head) {
  final parts = <String>[];
  var cursor = head;
  while (cursor != null) {
    parts.add(cursor.value.toString());
    cursor = cursor.next;
  }
  return '${parts.join(' -> ')} -> null';
}

void main() {
  var head = Node(10, Node(20, Node(30, Node(40))));
  const target = 30;
  var cursor = head;
  while (cursor.next != null) {
    if (cursor.next!.value == target) {
      cursor.next = cursor.next!.next;
      break;
    }
    cursor = cursor.next!;
  }
  print(render(head));
}

  1. head ← 10 -> 20 -> 30 -> 40 -> null, target ← 30

    1class Node {2  int value;
    values this step10 -> 20 -> 30 -> 40 -> nullhead30target

  2. cursor ← node(20)

    9var cursor = head;10while (cursor != null) {11  parts.add(cursor.value.toString());
    values this stepnode(10) → node(20)cursor

  3. cursor.next ← node(40)

    1class Node {2  int value;
    values this stepnode(30) → node(40)cursor.next

  4. stdout ← 10 -> 20 -> 40 -> null

    27  }28  print(render(head));29}
    values this step10 -> 20 -> 40 -> nullstdout10 -> 20 -> 40 -> nullhead

Complexity

  • Time: O(n)
  • Space: O(1)

Implementation notes

  • Keep the explicit node and pointer/reference operations; array shortcuts hide the linked-list state this lesson is meant to replay.
  • The final output prints the chain in a deterministic a -> b -> null form for cross-language comparison.