goqueue

README

linkedlist-queue

Documentation

Overview

Implementation queue with linkedlist

Index

• type List
  • func (l *List) Dequeue() interface{}
  • func (l *List) Enqueue(data interface{})
  • func (l *List) Peek() interface{}
  • func (l *List) String() string
• type Node
  • func NewNode(data interface{}) *Node
• type Queue
  • func NewQueue() Queue

Types

type List

type List struct {
	Head *Node
	Tail *Node
}

Linkedlist (Head, Tail)

func (*List) Dequeue

func (l *List) Dequeue() interface{}

Remove and retrieves the first element of this deque

func (*List) Enqueue

func (l *List) Enqueue(data interface{})

Inserts the specified element at the end of this queue

func (*List) Peek

func (l *List) Peek() interface{}

Retrieves, but does not remove, the first element of this deque

func (*List) String

func (l *List) String() string

Get all element in Queue

type Node

type Node struct {
	Prev *Node
	Next *Node
	Data interface{}
}

Linkedlist node (Prev, Next, Data)

func NewNode

func NewNode(data interface{}) *Node

Create new node

type Queue

type Queue interface {
	Enqueue(data interface{})
	Dequeue() interface{}
	String() string
	Peek() interface{}
}

Interface Queue

func NewQueue

func NewQueue() Queue

Initialize new queue