Leetcode/leetcode572.cpp at main · ksaini-web/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
/**
 * Definition for a binary tree node.
 * 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) {}
 * };
 */
class Solution {
public:

bool isIdentical(TreeNode* p, TreeNode* q){

    if(p==NULL || q==NULL ){
        return p ==q;
    }

    return p->val == q->val && isIdentical(p->left,q->left) && isIdentical(p->right , q->right);
}


    bool isSubtree(TreeNode* root, TreeNode* subRoot) {

        if(root == NULL && root  == NULL){
            return root == subRoot;
        }

        if(root->val == subRoot->val && isIdentical(root,subRoot)){

            return true;
        }

        return isSubtree(root->left,subRoot)||isSubtree(root->right,subRoot);

    }
};