-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtree.go
More file actions
63 lines (51 loc) · 1.3 KB
/
Copy pathtree.go
File metadata and controls
63 lines (51 loc) · 1.3 KB
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
59
60
61
62
63
package algorithm
type Tree struct {
RootNodeId int
NodeBoxes []TreeBox
}
type TreeBox struct {
Data TreeNodeData
FirstNode *TreeNode
ParentNode *TreeBox
}
type TreeNodeData struct {
Id int
ParentId int
}
type TreeNode struct {
Data TreeNodeData
Next *TreeNode
}
func NewTree(rootId int) Tree {
return Tree {
RootNodeId: rootId,
NodeBoxes: []TreeBox {},
}
}
func (t *Tree) CreateTree(data []TreeNodeData) {
var boxes map[int]*TreeBox = make(map[int]*TreeBox)
var pointer map[int][]*TreeNode = make(map[int][]*TreeNode)
for i, length := 0, len(data); i < length; i++ {
node := TreeNode { data[i], nil }
boxes[data[i].Id] = &TreeBox {data[i], nil, nil }
if pointer[data[i].ParentId] == nil {
pointer[data[i].ParentId] = []*TreeNode { &node, &node }
continue
}
pointer[data[i].ParentId][1].Next, pointer[data[i].ParentId] = &node, []*TreeNode { pointer[data[i].ParentId][0], &node }
}
for id, treeBox := range boxes {
if len(pointer[id]) > 0 {
treeBox.FirstNode = pointer[id][0]
}
treeBox.ParentNode = boxes[treeBox.Data.ParentId]
t.NodeBoxes = append(t.NodeBoxes, *treeBox)
}
}
func (t *Tree) ClearTree() {
t.NodeBoxes = []TreeBox {}
t.RootNodeId = 0
}
func (t *Tree) IsEmptyTree() bool {
return len(t.NodeBoxes) == 0
}