linkedlist

Documentation

Index

• func Display(head *node)
• func NewLinkedList(data []interface{}) *node
• func RemoveKthNodeToTail(head *node, K int) (*node, error)
• func Reverse(head *node) *node
• func Size(head *node) int

Functions

func Display

func Display(head *node)

Display display linked list contents

func NewLinkedList

func NewLinkedList(data []interface{}) *node

NewLinkedList factory function

func RemoveKthNodeToTail

func RemoveKthNodeToTail(head *node, K int) (*node, error)

RemoveKthNodeToTail remove k'th node before tail traverse through the linkedlist with 2 pointers to find k-1'th node then remove the node by manipulating the pointers O(n) time and O(1) space

func Reverse

func Reverse(head *node) *node

Reverse inplace reversal traverse through one time and reverse returns new head O(n) time, O(1) space

func Size

func Size(head *node) int

Size returns the Size of the linkedlist O(n) time, O(1) space