LeetCode 0101 - Symmetric Tree

Reck Zhang

发布于 2021-08-11 10:53:41

1910

发布于 2021-08-11 10:53:41

文章被收录于专栏：Reck Zhang

Symmetric Tree

Desicription

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

But the following [1,2,2,null,3,null,3] is not:

Note: Bonus points if you could solve it both recursively and iteratively.

Solution

/**
 * 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 {
private:
    bool isSymmetric(TreeNode* left, TreeNode* right) {
        if(left == NULL && right == NULL)
            return 1;
        if(left == NULL || right == NULL)
            return 0;
        if(left->val == right->val)
            return isSymmetric(left->left, right->right) && isSymmetric(left->right, right->left);
        return 0;
    }
public:
    bool isSymmetric(TreeNode* root) {
        if(root == NULL)
            return 1;
        return isSymmetric(root->left, root->right);
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-12-17，如有侵权请联系 cloudcommunity@tencent.com 删除

binary