/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
bool isSymmetrical(TreeNode* pRoot) {
if(!pRoot) return true;
return isSame(pRoot->left, pRoot->right);
}
bool isSame(TreeNode* le, TreeNode* ri) {
if(!le&&!ri) return true;
// if(!le&&ri) return false;
// if(le&&!ri) return false;
if(!le||!ri) return false;
if(le->val!=ri->val) return false;
return isSame(le->left, ri->right) && isSame(le->right, ri->left);
}
};
剑指数据结构-对称的二叉树
最新推荐文章于 2022-02-19 15:27:13 发布