/
unordered_list.go
58 lines (43 loc) · 1.02 KB
/
unordered_list.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//main package has examples shown
// in Hands-On Data Structures and algorithms with Go book
package main
// importing fmt package
import (
"fmt"
)
//Node class
type Node struct {
property int
nextNode *Node
}
// UnOrderedList class
type UnOrderedList struct {
headNode *Node
}
//AddToHead method of UnOrderedList class
func (UnOrderedList *UnOrderedList) AddToHead(property int) {
var node = &Node{}
node.property = property
node.nextNode = nil
if UnOrderedList.headNode != nil {
node.nextNode = UnOrderedList.headNode
}
UnOrderedList.headNode = node
}
//IterateList method iterates over UnOrderedList
func (UnOrderedList *UnOrderedList) IterateList() {
var node *Node
for node = UnOrderedList.headNode; node != nil; node = node.nextNode {
fmt.Println(node.property)
}
}
// main method
func main() {
var unOrderedList UnOrderedList
unOrderedList = UnOrderedList{}
unOrderedList.AddToHead(1)
unOrderedList.AddToHead(3)
unOrderedList.AddToHead(5)
unOrderedList.AddToHead(7)
unOrderedList.IterateList()
}