LeetCode - 101. Symmetric Tree

题目

LeetCode - 101. Symmetric Tree

题目链接

https://leetcode.com/problems/symmetric-tree/

参考博客

https://blog.csdn.net/crazy1235/article/details/51541984

解题思路

递归比较节点1的左（右）子树根节点与节点2的右（左）子树根节点。

解题源码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool checkNode(TreeNode* node1, TreeNode* node2)   {
        if (node1 == nullptr && node2 == nullptr) return true;
        if (node1 == nullptr || node2 == nullptr) return false;
        if (node1->val != node2->val) return false;
        else return checkNode(node1->left, node2->right) && checkNode(node1->right, node2->left);
    }
    bool isSymmetric(TreeNode* root) {
       if (root == nullptr) return true;
        return checkNode(root->left, root->right);
    }
};