/**
* 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 oper(TreeNode* left,TreeNode* right){
if(left==NULL&&right!=NULL)return false;
else if(left!=NULL&&right==NULL)return false;
else if(left==NULL&&right==NULL)return true;
else if(left->val!=right->val) return false;
return oper(left->right,right->left)&&oper(left->left,right->right);
}
bool isSymmetric(TreeNode* root) {
if(root==NULL)return true;
return oper(root->left,root->right);
}
};
101. 对称二叉树
最新推荐文章于 2024-08-09 20:36:57 发布