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
|
package set
type node struct {
key int
val int
left *node
right *node
}
type Tree struct {
root *node
}
func NewTree() *Tree {
return &Tree{}
}
func (t *Tree) Empty() bool {
return t.root == nil
}
func (t *Tree) set(n *node, key, val int) {
switch {
case key < n.key:
if n.left == nil {
n.left = &node{key, val, nil, nil}
return
}
t.set(n.left, key, val)
case key > n.key:
if n.right == nil {
n.right = &node{key, val, nil, nil}
return
}
t.set(n.right, key, val)
default:
// Val is already in the tree
}
}
func (t *Tree) Set(key, val int) {
if t.Empty() {
t.root = &node{key, val, nil, nil}
return
}
t.set(t.root, key, val)
}
func (t *Tree) get(n *node, key int) (int, error) {
if n == nil {
return 0, NotFound
}
switch {
case key < n.key:
return t.get(n.left, key)
case key > n.key:
return t.get(n.right, key)
default:
return n.val, nil
}
}
func (t *Tree) Get(key int) (int, error) {
return t.get(t.root, key)
}
/*
Get(key int) (int, error)
Del(key int) (int, error)
*/
|
