Hands-On High Performance with Go

Forward list

A forward list is an implementation of a singly linked list. A singly linked list typically has a smaller memory footprint than a doubly linked list; however, iteration through a singly linked list isn't as good, particularly in the reverse direction. Let's see how to implement a forward list:

1. First, we initialize our program and define our structures:

package mainimport "fmt"type SinglyLinkedList struct {    head *LinkedListNode}type LinkedListNode struct {    data string    next *LinkedListNode}

2. Then we create our Append function and apply it in our main function:

func (ll *SinglyLinkedList) Append(node *LinkedListNode) {    if ll.head == nil {        ll.head = node        return    }    currentNode := ll.head    for currentNode.next != nil { currentNode ...