-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSubtree.cpp
More file actions
64 lines (59 loc) · 1.46 KB
/
Subtree.cpp
File metadata and controls
64 lines (59 loc) · 1.46 KB
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
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param T1: The roots of binary tree T1.
* @param T2: The roots of binary tree T2.
* @return: True if T2 is a subtree of T1, or false.
*/
bool isSubtree(TreeNode * T1, TreeNode * T2) {
// write your code here
bool bSubTree = false;
if (T2 == NULL)
{
bSubTree = true;
}
else if (T1 == NULL && T2 != NULL)
{
bSubTree = false;
}
else
{
if (T1->val == T2->val)
{
bSubTree = isSameTree(T1, T2);
}
if (!bSubTree)
{
bSubTree = isSubtree(T1->left, T2);
}
if (!bSubTree)
{
bSubTree = isSubtree(T1->right, T2);
}
}
return bSubTree;
}
bool isSameTree(TreeNode* T1, TreeNode* T2)
{
bool bSame = false;
if (T1 == NULL && T2 == NULL)
bSame = true;
else if ((T1 == NULL && T2 != NULL) || (T1 != NULL && T2 == NULL) || (T1->val != T2->val))
bSame = false;
else
bSame = isSameTree(T1->left, T2->left) && isSameTree(T1->right, T2->right);
return bSame;
}
};