/
tree.go
84 lines (74 loc) · 2.01 KB
/
tree.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package util
//The Tree is binary sort Tree
type Tree struct {
root *Node
isAddToLeft func(node *Node, addRes interface{}) bool
}
func NewTree(isAddToLeft func(node *Node, addRes interface{}) bool) *Tree {
return &Tree{
isAddToLeft: isAddToLeft,
}
}
type Node struct {
Res interface{}
left, right *Node
}
func (t *Tree) GetRoot() *Node {
return t.root
}
//add res into Tree
func (t *Tree) AddNode(res interface{}) *Node {
return t.addNode(t.root, res)
}
func (t *Tree) addNode(n *Node, res interface{}) *Node {
if n == nil {
n = new(Node)
n.Res = res
if t.root == nil {
t.root = n
}
return n
}
if t.isAddToLeft(n, res) {
n.left = t.addNode(n.left, res)
} else {
n.right = t.addNode(n.right, res)
}
return n
}
//middle oder traversal, handle is the func that deals with the res, n is the start node to traversal
func (t *Tree) InOrderTraversal(n *Node, handle func(res interface{}) error) error {
if n == nil {
return nil
}
err := t.InOrderTraversal(n.left, handle)
if err != nil {
return err
}
err = handle(n.Res)
if err != nil {
return err
}
err = t.InOrderTraversal(n.right, handle)
if err != nil {
return err
}
return nil
}
//todo add asynchronous handle handle func: go handle