-
Notifications
You must be signed in to change notification settings - Fork 22
/
main.go
76 lines (64 loc) · 1.12 KB
/
main.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
package main
import (
"fmt"
)
func main() {
tree := &BinaryTree{}
tree.Insert(50)
tree.Insert(-10)
tree.Insert(-20)
tree.Insert(-15)
tree.Insert(5)
tree.Insert(15)
tree.Insert(-2)
tree.Insert(0)
tree.Insert(25)
tree.Display()
}
type BinaryTree struct {
Root *Node
}
type Node struct {
Left *Node
Right *Node
Data int
}
func (tree *BinaryTree) Insert(data int) *BinaryTree {
if tree.Root == nil {
tree.Root = &Node{Data: data, Left: nil, Right: nil}
} else {
tree.Root.Insert(data)
}
return tree
}
func (tree *BinaryTree) Display() {
tree.Root.Display(15)
}
func (node *Node) Insert(data int) {
if node == nil {
return
} else if data <= node.Data {
if node.Left == nil {
node.Left = &Node{Data: data, Left: nil, Right: nil}
} else {
node.Left.Insert(data)
}
} else {
if node.Right == nil {
node.Right = &Node{Data: data, Left: nil, Right: nil}
} else {
node.Right.Insert(data)
}
}
}
func (node *Node) Display(ns int) {
if node == nil {
return
}
for i := 0; i < ns; i++ {
fmt.Printf(" ")
}
fmt.Println(node.Data)
node.Left.Display(ns - 3)
node.Right.Display(ns + 3)
}