linkedlist

README

Single Linked List

Single Linkedlist Definition

A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration.

The principal benefit of a linked list over a conventional array is that the list elements can be easily inserted or removed without reallocation or reorganization of the entire structure because the data items need not be stored contiguously in memory or on disk, while restructuring an array at run-time is a much more expensive operation. Linked lists allow insertion and removal of nodes at any point in the list, and allow doing so with a constant number of operations by keeping the link previous to the link being added or removed in memory during list traversal.

This module serves as the base for all executable. So we don't have to redefine the Node, Linkedlist and the basic methods while solving the problems.

Documentation

Overview

Package linkedlist implements:

Create a a new Linkedlist and Node
Insert a Node at the beginning of the list
Insert a Node at the end of the list
Delete a Node from the beginning of the list
Delete a Node from the end of the list
Print the Linkedlis

Index

• type Linkedlist
  • func NewLinkedlist() *Linkedlist
  • func (ll *Linkedlist) AddAtBeg(val interface{})
  • func (ll *Linkedlist) AddAtEnd(val interface{})
  • func (ll *Linkedlist) DelAtBeg() interface{}
  • func (ll *Linkedlist) DelAtEnd() interface{}
  • func (ll *Linkedlist) DeleteWithValute(val interface{}) interface{}
  • func (ll *Linkedlist) String() string
• type Node
  • func NewNode(val interface{}) *Node

Types

type Linkedlist

type Linkedlist struct {
	Length int
	Head   *Node
}

Linkedlist struct holds a linked list

func NewLinkedlist

func NewLinkedlist() *Linkedlist

NewLinkedlist creates a new linked list

func (*Linkedlist) AddAtBeg

func (ll *Linkedlist) AddAtBeg(val interface{})

AddAtBeg adds a Node at the beginning of the list

func (*Linkedlist) AddAtEnd

func (ll *Linkedlist) AddAtEnd(val interface{})

AddAtEnd adds a Node at the end of the list

func (*Linkedlist) DelAtBeg

func (ll *Linkedlist) DelAtBeg() interface{}

DelAtBeg deletes a node from the beginning of the list

func (*Linkedlist) DelAtEnd

func (ll *Linkedlist) DelAtEnd() interface{}

DelAtEnd deletes a node from the end of the list

func (*Linkedlist) DeleteWithValute

func (ll *Linkedlist) DeleteWithValute(val interface{}) interface{}

DeleteWithValute deletes a node which value is equal to the function parameter

func (*Linkedlist) String

func (ll *Linkedlist) String() string

utility function to print the linkedlist

type Node

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

Node struct holds a node the value of the Node could be anything (int, string or a struncture) interface{} - an empty interface may hold values of any type. if using interface{} confuse you, change with any type you would like initially I started with int value, but some problems require strings as values another example: implementing Hash-Table I need even to define a Key-Value struct

func NewNode

func NewNode(val interface{}) *Node

NewNode creates a new node