cpp-handwritten-coding-public/problems/binary_tree/tests/main.cpp at main · Excaliiiibur/cpp-handwritten-coding-public · GitHub

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
94
95
96
#include <cassert>
#include <optional>
#include <stdexcept>
#include <vector>

#include "binary_tree.h"

static void expectEq(const std::vector<int>& actual,
                      const std::vector<int>& expected) {
    assert(actual == expected);
}

static void testBuildFromLevelOrder() {
    BinaryTree tree({
        1,
        2,
        3,
        4,
        5,
        std::nullopt,
        6,
    });

    assert(!tree.empty());
    expectEq(tree.preorder(), {1, 2, 4, 5, 3, 6});
    expectEq(tree.inorder(), {4, 2, 5, 1, 3, 6});
    expectEq(tree.postorder(), {4, 5, 2, 6, 3, 1});
    expectEq(tree.level_order(), {1, 2, 3, 4, 5, 6});
}

static void testBuildFromPreorderAndInorder() {
    std::vector<int> preorder = {1, 2, 4, 5, 3, 6};
    std::vector<int> inorder = {4, 2, 5, 1, 3, 6};

    BinaryTree tree(preorder, inorder);

    expectEq(tree.preorder(), preorder);
    expectEq(tree.inorder(), inorder);
    expectEq(tree.postorder(), {4, 5, 2, 6, 3, 1});
    expectEq(tree.level_order(), {1, 2, 3, 4, 5, 6});
}

static void testEmptyTree() {
    BinaryTree tree;

    assert(tree.empty());
    expectEq(tree.preorder(), {});
    expectEq(tree.inorder(), {});
    expectEq(tree.postorder(), {});
    expectEq(tree.level_order(), {});
}

static void testEmptyLevelOrder() {
    BinaryTree tree({std::nullopt});

    assert(tree.empty());
    expectEq(tree.level_order(), {});
}

static void testClear() {
    BinaryTree tree({1, 2, 3});

    assert(!tree.empty());
    tree.clear();
    assert(tree.empty());
    expectEq(tree.level_order(), {});
}

static void testInvalidBuildInput() {
    bool thrown = false;
    try {
        BinaryTree tree({1, 2}, {2});
    } catch (const std::invalid_argument&) {
        thrown = true;
    }
    assert(thrown);

    thrown = false;
    try {
        BinaryTree tree({1, 2}, {2, 3});
    } catch (const std::invalid_argument&) {
        thrown = true;
    }
    assert(thrown);
}

int main() {
    testBuildFromLevelOrder();
    testBuildFromPreorderAndInorder();
    testEmptyTree();
    testEmptyLevelOrder();
    testClear();
    testInvalidBuildInput();

    return 0;
}