题解 | #对称的二叉树#

//递归
#include <stdbool.h>
bool Judge(struct TreeNode* left, struct TreeNode* right);
bool isSymmetrical(struct TreeNode* pRoot ) {
    // write code here
    if(pRoot == NULL) return true;
    return Judge(pRoot->left, pRoot->right);
}

bool Judge(struct TreeNode* left, struct TreeNode* right){
    if(left == NULL && right == NULL) return true;
    if(left == NULL || right == NULL) return false;
    if(left->val != right->val) return false;
    
    return Judge(left->left, right->right) && Judge(left->right, right->left);
}