March 2019
Intermediate to advanced
336 pages
9h 9m
English
A circular-linked list is a collection of nodes in which the last node is connected to the first node. Circular-linked lists were briefly covered in Chapter 4, Non-Linear Data Structures. Circular-linked lists are used to create a circular queue.
In the following section, a circular queue struct is defined and implemented. The methods that are explained in this section are part of the circular_queue.go file given in the code bundle.
Read now
Unlock full access