LinkedList

package

v0.0.0-...-c4df37a Latest Latest Go to latest Published: Jun 6, 2021 License: MIT Imports: 1 Imported by: 0

Details

This section is empty.

View Source

var (
	ErrorEmptyList = errors.New("a list is empty")
)

This section is empty.

type LinkedList struct {
	// contains filtered or unexported fields
}

LinkedList is a struct that has pointers to the first and last nodes and also size of a list.

func NewLinkedList() *LinkedList

NewLinkedList builds an empty linked list and returns its pointer.

func (l *LinkedList) Append(value interface{})

Append adds an element to the end of a list.

func (l *LinkedList) Count(value interface{}) int

Count returns a number of times a given value is occurred in a list.

func (l *LinkedList) PeekFirst() (interface{}, error)

PeekFirst takes first element of a list. If a list is empty returns an error.

func (l *LinkedList) PeekLast() (interface{}, error)

PeekLast takes last element of a list. If a list is empty returns an error.

func (l *LinkedList) Prepend(value interface{})

Prepend adds an element to the front of a list.

func (l *LinkedList) Size() int

Size returns the number of nodes in a list.

type Node struct {
	Value interface{}
	Next  *Node
}

Node is a unit in a linked list, that stores data and a pointer to the next element.