-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathmain.go
72 lines (66 loc) · 956 Bytes
/
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
package main
import (
"fmt"
"testing"
)
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func isCompleteTree(root *TreeNode) bool {
var missingNode bool
queue := []*TreeNode{root}
for len(queue) > 0 {
node := queue[0]
queue = queue[1:]
if node == nil {
missingNode = true
continue
}
if missingNode {
return false
}
queue = append(queue, node.Left, node.Right)
}
return true
}
func Test958(t *testing.T) {
fmt.Println(isCompleteTree(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Left: &TreeNode{
Val: 4,
},
Right: &TreeNode{
Val: 5,
},
},
Right: &TreeNode{
Val: 3,
Left: &TreeNode{
Val: 6,
},
},
}))
fmt.Println(isCompleteTree(&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Left: &TreeNode{
Val: 4,
},
Right: &TreeNode{
Val: 5,
},
},
Right: &TreeNode{
Val: 3,
Right: &TreeNode{
Val: 7,
},
},
}))
t.Error()
}