[LeetCode]101. Symmetric Tree

[LeetCode]101. Symmetric Tree

题目描述

思路

递归解法，比较左右节点
如果左右节点均为空返回true，如果左右节点只有一个为空返回false
如果左右节点均不为空
比较左右节点的值，并且递归比较左节点的左子节点和右节点的右子节点，左节点的右子节点和右节点的左子节点。

代码

#include <iostream>

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        return root == NULL || isSymmetric(root->left, root->right);
    }

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

int main() {
    TreeNode* n1 = new TreeNode(1);
    TreeNode* n2 = new TreeNode(2);
    TreeNode* n3 = new TreeNode(2);
    TreeNode* n4 = new TreeNode(3);
    TreeNode* n5 = new TreeNode(4);
    TreeNode* n6 = new TreeNode(4);
    TreeNode* n7 = new TreeNode(3);

    n1->left = n2, n1->right = n3;
    //n2->left = n4;
    n2->right = n5;
    //n3->left = n6;
    n3->right = n7;

    Solution s;
    cout << s.isSymmetric(n1) << endl;

    system("pause");
    return 0;
}