LeetCodeProblems/101.cpp at main · arsendulaev/LeetCodeProblems · 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
48
49
50
51
52
53
//
// Created by arsen on 30.10.2025.
//
#include <cstddef>
#include <iostream>
#include <queue>
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 isSymmetric(TreeNode *root) {
        if (!root) {
            return true;
        }
        std::queue<TreeNode*> queueLeft;
        std::queue<TreeNode*> queueRight;
        queueLeft.push(root->left);
        queueRight.push(root->right);
        while (!queueLeft.empty() && !queueRight.empty()) {
            TreeNode* left = queueLeft.front();
            TreeNode* right = queueRight.front();
            queueLeft.pop();
            queueRight.pop();
            if (left == nullptr && right == nullptr) {
                continue;
            }
            if (left == nullptr || right == nullptr || left->val != right->val) {
                return false;
            }
            queueLeft.push(left->left);
            queueLeft.push(left->right);
            queueRight.push(right->right);
            queueRight.push(right->left);
        }
        return queueLeft.empty() && queueRight.empty();
    }
};

int main() {
    Solution s;
    TreeNode root(1);
    root.left = new TreeNode(2, new TreeNode(3), new TreeNode(4));
    root.right = new TreeNode(2, new TreeNode(4), new TreeNode(3));
    std::cout << s.isSymmetric(&root);
    return 0;
}