package main
import "fmt"
type Node struct {
prev *Node
next *Node
val interface{}
}
type LL struct {
head *Node
tail *Node
}
func (ll *LL) Insert(val interface{}) {
linklist := &Node {
next: ll.head,
val: val,
}
if ll.head != nil {
ll.head.prev = linklist
}
ll.head = linklist
ltail := ll.head
for ltail.next != nil {
ltail = ltail.next
}
ll.tail = ltail
}
func (ll *LL) Print() {
llist := ll.head
for llist != nil {
fmt.Printf("%+v - ", llist.val)
llist = llist.next
}
fmt.Println()
}
func (ll *LL) Reverse() {
current := ll.head
var prev *Node
ll.tail = ll.head
for current != nil {
next := current.next
current.next = prev
prev = current
current = next
}
ll.head = prev
}
func main() {
linklist := LL{}
linklist.Insert(6)
linklist.Insert(1)
linklist.Insert(87)
linklist.Insert(34)
linklist.Insert(982)
linklist.Insert(7)
linklist.Insert(3)
linklist.Insert(99)
linklist.Print()
linklist.Reverse()
linklist.Print()
}
/*
run:
99 - 3 - 7 - 982 - 34 - 87 - 1 - 6 -
6 - 1 - 87 - 34 - 982 - 7 - 3 - 99 -
*/
