给你一个二叉树的根节点 root
, 检查它是否轴对称。
示例 1:
输入:root = [1,2,2,3,4,4,3] 输出:true
示例 2:
输入:root = [1,2,2,null,3,null,3] 输出:false
提示:
- 树中节点数目在范围
[1, 1000]
内 -100 <= Node.val <= 100
代码:
/**
* 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 *rpre, TreeNode *lpre) {
if (rpre == nullptr && lpre == nullptr) {
return true;
}
else if (rpre == nullptr || lpre == nullptr) {
return false;
}
return rpre->val == lpre->val && check(rpre->right, lpre->left) && check(rpre->left, lpre->right);
}
bool isSymmetric(TreeNode* root) {
return check(root, root);
}
};