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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
import { assertEquals } from "https://deno.land/std@0.157.0/testing/asserts.ts";
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";import levelOrder from "../binary-tree-level-order-traversal/index.ts";import { zip } from "../deps.ts";import CBTInserter from "./index.ts";
Deno.test("complete-binary-tree-inserter-1", () => {    const root = new TreeNode(1, new TreeNode(2));    const cbt = new CBTInserter(root);
    assertEquals(cbt.insert(3), 1);    assertEquals(cbt.insert(4), 2);
    assertEquals(        cbt.get_root(),        new TreeNode(1, new TreeNode(2, new TreeNode(4)), new TreeNode(3)),    );});Deno.test("complete-binary-tree-inserter-2", () => {    const root = new TreeNode(1, new TreeNode(2));    const cbt = new CBTInserter(root);
    assertEquals(cbt.insert(3), 1);    assertEquals(cbt.insert(4), 2);
    assertEquals(        cbt.get_root(),        new TreeNode(1, new TreeNode(2, new TreeNode(4)), new TreeNode(3)),    );    assertEquals(cbt.insert(13), 2);    assertEquals(cbt.insert(14), 3);    assertEquals(cbt.insert(213), 3);    assertEquals(cbt.insert(124), 4);    assertEquals(cbt.insert(313), 4);    assertEquals(cbt.insert(134), 13);    assertEquals(        [1, 2, 3, 4, 13, 14, 213, 124, 313, 134],        levelOrder(cbt.get_root()).flat(),    );});Deno.test("complete-binary-tree-inserter-3", () => {    const data = zip(        [            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",            "insert",        ],        [            [2],            [3],            [4],            [5],            [6],            [7],            [8],            [9],            [10],            [11],            [12],            [13],            [14],            [15],            [16],        ],        [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8],    ) as [string, number[], number][];    const root = new TreeNode(1);    const cbt = new CBTInserter(root);    for (const [target, args, result] of data) {        assertEquals(            Reflect.apply(Reflect.get(cbt, target), cbt, args),            result,        );    }    assertEquals(        [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16],        levelOrder(cbt.get_root()).flat(),    );});