Mastering Go - Second Edition

Implementing a queue in Go

The program that will illustrate the Go implementation of a queue is called queue.go, and it will be presented in five parts. Note that a linked list is going to be used for the implementation of the queue. The Push() and Pop() functions are used for adding and removing nodes from the queue, respectively.

The first part of the code for queue.go is as follows:

package main 
 
import ( 
    "fmt" 
) 
 
type Node struct { 
    Value int 
    Next  *Node 
} 
 
var size = 0 
var queue = new(Node) 

Having a variable (size) for keeping the number of nodes that you have on the queue is handy but not compulsory. However, the implementation presented here supports this functionality because it makes things simpler. In practice, you will probably want ...