直接上代码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
68package concurrent
import "fmt"
type TreeNode struct {
value int
leftNode,rightNode *TreeNode
}
//结构体创建 工厂函数
func createNode(value int) *TreeNode {
return &TreeNode{value:value}
}
func (node TreeNode) print() {
fmt.Println(node.value)
}
func (node *TreeNode) traverseFun(f func(*TreeNode)) {
if nil == node {
return
}
f(node)
node.leftNode.traverseFun(f)
node.rightNode.traverseFun(f)
}
func (node *TreeNode) traverse() chan *TreeNode{
c := make(chan *TreeNode)
go func() {
node.traverseFun(func(node *TreeNode) {
c <- node
fmt.Println(node.value)
})
close(c)
}()
return c
}
func ChannelTraverseTree() {
//创建结构体 方式二
root := TreeNode{value:-1}
//创建结构体 方式三
//root := new(treeNode)
//构建树
root.leftNode = &TreeNode{value:1}
root.rightNode = &TreeNode{value:2}
root.leftNode.leftNode = createNode(11)
root.leftNode.rightNode = createNode(12)
root.rightNode.leftNode = createNode(21)
root.rightNode.rightNode = createNode(22)
fmt.Println(root)
c := root.traverse()
maxValue := 0
for node := range c{
if node.value > maxValue {
maxValue = node.value
}
}
fmt.Printf("最大的值是%d \n",maxValue)//22
}