Leetcode-Solutions/0101-symmetric-tree/0101-symmetric-tree.cpp at main · karygauss03/Leetcode-Solutions · GitHub

Name: Leetcode-Solutions/0101-symmetric-tree/0101-symmetric-tree.cpp at main · karygauss03/Leetcode-Solutions · GitHub
Rating: 4.9 (6595 reviews)
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
/**
 * 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) {}
 * };
*/
classSolution {
public:
boolcheck(TreeNode* u, TreeNode* v){
if (!u && !v) returntrue;
if (u && v){
if (u->val != v->val) returnfalse;
elsereturncheck(u->left, v->right) && check(u->right, v->left);
 }
returnfalse;
 }
boolisSymmetric(TreeNode* root) {
returncheck(root->left, root->right);
 }
};