Competitive_Programming/LeetCode/Full_List/100.cpp at master · Ravi-Maurya/Competitive_Programming · 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
/**
 * 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 check(TreeNode* a, TreeNode* b){
        if(!a && !b)
            return true;
        if(!a || !b)
            return false;
        return (a->val == b->val);
    }
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(!p && !q)
            return true;
        if(!check(p,q))
            return false;
        queue<TreeNode*> dqp, dqq;
        dqp.push(p);
        dqq.push(q);
        while(!dqp.empty() && !dqq.empty()){
            p = dqp.front();dqp.pop();
            q = dqq.front();dqq.pop();
            if(!check(p,q))
                return false;
            if(p){
                dqp.push(p->left);
                dqp.push(p->right);
            }
            if(q){
                dqq.push(q->left);
                dqq.push(q->right);
            }
        }
        if(dqp.empty() && dqp.empty())
            return true;
        return false;
    }
};