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 Go DSA implementation uses the same small chain as the rest of the DSA track.

Basic Implementation

basic.go

package main

import (
	"fmt"
	"strings"
)

type Node struct {
	Value int
	Next  *Node
}

func render(head *Node) string {
	parts := []string{}
	for cursor := head; cursor != nil; cursor = cursor.Next {
		parts = append(parts, fmt.Sprint(cursor.Value))
	}
	return strings.Join(parts, " -> ") + " -> null"
}

func main() {
	head := &Node{10, &Node{20, &Node{30, &Node{40, nil}}}}
	target := 30
	cursor := head
	for cursor.Next != nil {
		if cursor.Next.Value == target {
			cursor.Next = cursor.Next.Next
			break
		}
		cursor = cursor.Next
	}
	fmt.Println(render(head))
}

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.

predecessor Deletion needs the node before the one being removed.

rewiring The predecessor skips the target and points at the target's next node.