leetcode/src/sameTree.cpp at master · markhary/leetcode · 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
// https://leetcode.com/problems/same-tree/
//
// Status: Accepted
// Runtime: 8ms
// Score: 97.83%
//

#include <iostream>
#include <vector>

#include <gtest/gtest.h>
#include "args.h"
#include "leetcode.h"
#include "macros.h"

using namespace std;

class Solution
{
public:
    bool isSameTree(TreeNode *p, TreeNode *q)
    {
        bool same = true;

        if (p && q)
        {
            return ((p->val == q->val) &&
                    (isSameTree(p->left, q->left)) &&
                    (isSameTree(p->right, q->right)));
        }
        else if (p || q)
        {
            same = false;
        }

        return same;
    }
};

TEST(SameTree, Sample)
{
    TreeNode p[3] = {1, 2, 3};
    TreeNode q[3] = {1, 2, 3};

    p[0].left = &p[1];
    p[0].right = &p[2];
    q[0].left = &q[1];
    q[0].right = &q[2];

    Solution solution;
    ASSERT_EQ(solution.isSameTree(p, q), true);

    p[0].left = nullptr;
    ASSERT_EQ(solution.isSameTree(p, q), false);
}

TEST(SameTree, Empty)
{
    Solution solution;
    ASSERT_EQ(solution.isSameTree(nullptr, nullptr), true);
}

TEST(SameTree, Simple)
{
    TreeNode p(5);
    Solution solution;

    ASSERT_EQ(solution.isSameTree(&p, nullptr), false);
}