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 C# 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.cs
Replay: real traced execution (multi-file project)
using System;
using System.Text;

class Node {
    public int Value;
    public Node? Next;
    public Node(int value, Node? next = null) {
        Value = value;
        Next = next;
    }
}

class Program {
    static string Render(Node? head) {
        var outText = new StringBuilder();
        var cursor = head;
        while (cursor != null) {
            if (outText.Length > 0) outText.Append(" -> ");
            outText.Append(cursor.Value);
            cursor = cursor.Next;
        }
        return outText.Append(" -> null").ToString();
    }
    static void Main() {
        Node head = new Node(10, new Node(20, new Node(30, new Node(40))));
        int target = 30;
        Node cursor = head;
        while (cursor.Next != null) {
            if (cursor.Next.Value == target) {
                cursor.Next = cursor.Next.Next;
                break;
            }
            cursor = cursor.Next;
        }
        Console.WriteLine(Render(head));
    }
}

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

    1using System;2using System.Text;
    values this step10 -> 20 -> 30 -> 40 -> nullhead30target

  2. cursor ← node(20)

    16var cursor = head;17while (cursor != null) {18    if (outText.Length > 0) outText.Append(" -> ");
    values this stepnode(10) → node(20)cursor

  3. cursor.next ← node(40)

    29if (cursor.Next.Value == target) {30    cursor.Next = cursor.Next.Next;31    break;
    values this stepnode(30) → node(40)cursor.next

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

    34    }35    Console.WriteLine(Render(head));36}
    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.