LeetCode/SameTree.cpp at master · MihailKuzhbanov/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
//task 100
//0ms 9.7mb

/*
 * Definition for a binary tree node.
 * struct TreeNode
 * {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

//external funtion use
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q)
    {
        return isSamePart(p, q);
    }

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

//without external function
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q)
    {
        if(!p && !q)    return true;
        if(!p || !q)    return false;
        if(p->val != q->val)    return false;
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    }

};