A node is an element in a linked list that stores a value and a pointer to the next node. Unlike slice elements, nodes need not occupy contiguous memory, allowing insertion and removal without shifting other elements. section 6.1
Go can make the node generic: node[T any] accepts any value type while preserving type safety. The same type parameter can flow into the stored value and the next-node pointer. section 6.1
Listing 6.1 A generic node implementation
type node[T any] struct { #1
value T #2
next *node[T] #3
}
Inspect the minimal generic node definition, including its type parameter, stored value, and pointer to the next node. section 6.1
Nodes are useful for teaching generic data structures, although slices usually provide the simpler production choice in Go. section 6.1
