-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbinaryTree.go
More file actions
88 lines (77 loc) · 1.49 KB
/
Copy pathbinaryTree.go
File metadata and controls
88 lines (77 loc) · 1.49 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
package binaryTree
import (
"sync"
"fmt"
)
type treesFun interface {
Insert(int)
}
type treeNode struct{
value int
leftNode *treeNode
rightNode *treeNode
}
type myTree struct{
root *treeNode
lock sync.Mutex
treesFun
}
func InsertTree(treeNode *treeNode, newTree *treeNode){
if newTree.value > treeNode.value{
if treeNode.rightNode != nil{
InsertTree(treeNode.rightNode, newTree)
}else{
treeNode.rightNode = newTree
}
}else{
if treeNode.leftNode != nil{
InsertTree(treeNode.leftNode, newTree)
}else{
treeNode.leftNode = newTree
}
}
}
func (node *myTree)Insert(value int){
node.lock.Lock()
defer node.lock.Unlock()
newNode := new(treeNode)
newNode.value = value
if node.root == nil{
node.root = newNode
}else{
InsertTree(node.root, newNode)
}
}
func BinaSearch(tree *treeNode, value int) (bool){
fmt.Println(tree.value, value)
if tree.value > value {
if tree.rightNode != nil {
return BinaSearch(tree.rightNode, value)
} else {
return false
}
}else if tree.value < value{
if tree.rightNode != nil{
return BinaSearch(tree.rightNode, value)
}else{
return false
}
}else{
return true
}
}
func PreorderTraveser(node *treeNode){
if node != nil {
fmt.Println(node.value)
PreorderTraveser(node.leftNode)
PreorderTraveser(node.rightNode)
}
}
func InorderTraverser(node *treeNode){
fmt.Println("xxxx", node)
if node != nil{
InorderTraverser(node.leftNode)
fmt.Println(node.value)
InorderTraverser(node.rightNode)
}
}