Mastering-Go-Second-Edition/ch05/doublyLList.go
2019-01-10 22:09:57 +02:00

115 lines
1.4 KiB
Go

package main
import (
"fmt"
)
type Node struct {
Value int
Previous *Node
Next *Node
}
func addNode(t *Node, v int) int {
if root == nil {
t = &Node{v, nil, nil}
root = t
return 0
}
if v == t.Value {
fmt.Println("Node already exists:", v)
return -1
}
if t.Next == nil {
temp := t
t.Next = &Node{v, temp, nil}
return -2
}
return addNode(t.Next, v)
}
func traverse(t *Node) {
if t == nil {
fmt.Println("-> Empty list!")
return
}
for t != nil {
fmt.Printf("%d -> ", t.Value)
t = t.Next
}
fmt.Println()
}
func reverse(t *Node) {
if t == nil {
fmt.Println("-> Empty list!")
return
}
temp := t
for t != nil {
temp = t
t = t.Next
}
for temp.Previous != nil {
fmt.Printf("%d -> ", temp.Value)
temp = temp.Previous
}
fmt.Printf("%d -> ", temp.Value)
fmt.Println()
}
func size(t *Node) int {
if t == nil {
fmt.Println("-> Empty list!")
return 0
}
n := 0
for t != nil {
n++
t = t.Next
}
return n
}
func lookupNode(t *Node, v int) bool {
if root == nil {
return false
}
if v == t.Value {
return true
}
if t.Next == nil {
return false
}
return lookupNode(t.Next, v)
}
var root = new(Node)
func main() {
fmt.Println(root)
root = nil
traverse(root)
addNode(root, 1)
addNode(root, 1)
traverse(root)
addNode(root, 10)
addNode(root, 5)
addNode(root, 0)
addNode(root, 0)
traverse(root)
addNode(root, 100)
fmt.Println("Size:", size(root))
traverse(root)
reverse(root)
}