ds

package
v0.1.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 26, 2018 License: MIT Imports: 1 Imported by: 0

README

ds

Data Structure Description
Queue First-in first-out (FIFO)
Stack Last-in first-out (LIFO)

heap

Heap Description
MinHeap Min-Heap priority queue
MaxHeap Max-Heap priority queue

st

Symbol Table Ordered Self-Balancing Description
BST Yes No Binary search tree
AVL Yes Yes AVL binary search tree
RedBlack Yes Yes Red-Black binary search tree

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Queue

type Queue interface {
	Size() int
	IsEmpty() bool
	Enqueue(Generic)
	Dequeue() Generic
	Peek() Generic
	Contains(Generic) bool
}

Queue represents a stack data structure

func NewQueue

func NewQueue(nodeSize int, compare Compare) Queue

NewQueue creates a new array-list queue

type Stack

type Stack interface {
	Size() int
	IsEmpty() bool
	Push(Generic)
	Pop() Generic
	Peek() Generic
	Contains(Generic) bool
}

Stack represents a stack data structure

func NewStack

func NewStack(nodeSize int, compare Compare) Stack

NewStack creates a new array-list stack

Directories

Path Synopsis

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL