-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree_lca_test.go
58 lines (51 loc) · 1.4 KB
/
tree_lca_test.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
package problem0236
import (
"fmt"
"testing"
. "leetcodedaily/helpers/binarytree"
"github.com/stretchr/testify/assert"
)
type Result struct {
Input *TreeNode
P, Q *TreeNode
Expected *TreeNode
}
var Results = []Result{
{&TreeNode{Val: 3,
Left: &TreeNode{Val: 5,
Left: &TreeNode{Val: 6},
Right: &TreeNode{Val: 2,
Left: &TreeNode{Val: 7},
Right: &TreeNode{Val: 4}}},
Right: &TreeNode{Val: 1,
Left: &TreeNode{Val: 0},
Right: &TreeNode{Val: 8}}},
&TreeNode{Val: 5}, &TreeNode{Val: 1}, &TreeNode{Val: 3}},
{&TreeNode{Val: 3,
Left: &TreeNode{Val: 5,
Left: &TreeNode{Val: 6},
Right: &TreeNode{Val: 2,
Left: &TreeNode{Val: 7},
Right: &TreeNode{Val: 4}}},
Right: &TreeNode{Val: 1,
Left: &TreeNode{Val: 0},
Right: &TreeNode{Val: 8}}},
&TreeNode{Val: 5}, &TreeNode{Val: 4}, &TreeNode{Val: 5}},
{&TreeNode{Val: 1, Left: &TreeNode{Val: 2}},
&TreeNode{Val: 1}, &TreeNode{Val: 2}, &TreeNode{Val: 1}},
{&TreeNode{Val: -1,
Left: &TreeNode{Val: 0,
Left: &TreeNode{Val: -2,
Left: &TreeNode{Val: 8}},
Right: &TreeNode{Val: 4}},
Right: &TreeNode{Val: 3}},
&TreeNode{Val: 3}, &TreeNode{Val: 8}, &TreeNode{Val: -1}},
}
func TestLowestCommonAncestor(t *testing.T) {
assert := assert.New(t)
for _, res := range Results {
want := res.Expected
got := lowestCommonAncestor(res.Input, res.P, res.Q)
assert.Equal(want.Val, got.Val, fmt.Sprintf("%+v", res))
}
}