LeetCode_Tasks/0100. Same Tree.cpp at master · DimitarDTsonev/LeetCode_Tasks · 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
// Task : https://leetcode.com/problems/same-tree/

#include<iostream>

struct TreeNode {
	int val;
	TreeNode* left;
	TreeNode* right;
	TreeNode() : val(0), left(nullptr), right(nullptr) {}
	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
	TreeNode(int x, TreeNode* left, TreeNode* right) : val(x), left(left), right(right) {}
};

bool isSameTree(TreeNode* p, TreeNode* q) {
	if (p == nullptr && q == nullptr) {
		return true;
	}
	if (p == nullptr || q == nullptr || p->val != q->val) {
		return false;
	}

	return isSameTree1(p->left, q->left) && isSameTree1(p->right, q->right);
}

int main() {
    // Test 1:
	TreeNode* root1 = new TreeNode(1, new TreeNode(2), new TreeNode(3));
	TreeNode* root2 = new TreeNode(1, new TreeNode(2), new TreeNode(3));

	std::cout << isSameTree(root1, root2) << std::endl;

    // Test 2:
	TreeNode* root3 = new TreeNode(1, new TreeNode(2), nullptr);
	TreeNode* root4 = new TreeNode(1, nullptr, new TreeNode(2));

	std::cout << isSameTree(root3, root4) << std::endl;

    // Test 3:
	TreeNode* root5 = new TreeNode(1, new TreeNode(2), new TreeNode(1));
	TreeNode* root6 = new TreeNode(1, new TreeNode(1), new TreeNode(3));

	std::cout << isSameTree(root5, root6) << std::endl;

	return 0;
}