二叉树习题精讲-镜像二叉树

101. 对称二叉树 - 力扣（LeetCode）https://leetcode.cn/problems/symmetric-tree/description/

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool isSameTree(struct TreeNode* p, struct TreeNode* q) 
{
    //遍历结束
    if(q==NULL && p==NULL)
        return true;
    //不相等条件    
    if(q==NULL || p==NULL)
        return false;
    //不相等条件
    if(q->val != p->val)
        return false;
    return isSameTree(p->left,q->right) && isSameTree(p->right,q->left);
}
bool isSymmetric(struct TreeNode* root) 
{
    if(root == NULL)
        return true;
    int ret = isSameTree(root->left,root->right);
    return ret;
}

这里的逻辑和相同二叉树一样