Leetcode 101. Symmetric Tree (Easy) (cpp)
Tag: Tree, Depth-first Search, Breadth-first Search
Difficulty: Easy
/*
101. Symmetric Tree (Easy)
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/ \
2 2
\ \
3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if (!root) return true;
return check(root -> left, root -> right);
}
bool check(TreeNode* L, TreeNode* R) {
if (!L || !R) {
if (L || R) return false;
return true;
}
return L -> val == R -> val && check(L -> left, R -> right) && check(L -> right, R -> left);
}
};