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
package check_completeness_of_a_binary_tree
import (	// "fmt"	"testing"
	"github.com/akrennmair/slice"	"github.com/masx200/leetcode-test/utils"	"gotest.tools/v3/assert")
var deserialize = utils.TreeNodeLeetCodeParse
func TestIsCompleteTree(t *testing.T) {	var inputs = []string{		"[1,2,3,4,5,6,7]",		"[1,2,3,4,5,null,7]",
		"[1,2,3,4,5,6,7,8,9,10,11,12,13,null,null,15]",		"[1,2,3,5,null,7,8]",		"[1,2,3,4,5,6]",
		"[1,2,3,4,5,6]",		"[1,2,3,4,5,6,7,8,9,10,11,12,13,null,null,15]",	}	var outputs = []bool{true, false, false, false, true, true, false}	assert.DeepEqual(t, slice.Map(inputs, func(input string) bool {		// fmt.Println(input)		root := deserialize(input)		// fmt.Println(root)		return IsCompleteTree(root)	}), outputs)}