Go Linked List Example

ll.go

package main

import "fmt"

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

type list struct {
	Len        int
	Head, Tail *Node
}

func (L *list) Push(n *Node) {
	if L.Len == 0 {
		L.Head = n
	} else {
		L.Tail.Next = n
	}
	L.Tail = n
	L.Len++
}

func main() {
	L := &list{}
	n1, n2, n3 := &Node{1, nil}, &Node{2, nil}, &Node{3, nil}
	L.Push(n1)
	L.Push(n2)
	L.Push(n3)
	for curr := L.Head; curr != nil; curr = curr.Next {
		fmt.Printf("%#v", curr.Data)
	}
}