101. Symmetric Tree(easy)

Easy

190843FavoriteShare

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:

    1
   / \
  2   2
 / \ / \
3  4 4  3

 

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

    1
   / \
  2   2
   \   \
   3    3

 

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

C++：

层序遍历判断每一层是否为回文序列：

/*
 * @Author: SourDumplings
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/symmetric-tree/
 * @Date: 2019-02-28 18:44:42
 */

/**
 * 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 isSymmetric(TreeNode *root)
    {
        queue<TreeNode *> q;
        q.push(root);

        while (true)
        {
            deque<TreeNode *> dq;
            while (!q.empty())
            {
                dq.push_back(q.front());
                q.pop();
            }
            if (!plalindrome(dq))
            {
                return false;
            }
            else
            {
                bool flag = true;
                while (!dq.empty())
                {
                    TreeNode *temp = dq.front();
                    if (temp)
                    {
                        flag = false;
                        q.push(temp->left);
                        q.push(temp->right);
                    }
                    dq.pop_front();
                }
                if (flag)
                {
                    break;
                }
            }
        }
        return true;
    }

    bool plalindrome(const deque<TreeNode *> &dq)
    {
        int n = dq.size();
        for (int i = 0; i < n / 2; i++)
        {
            if (dq[i] && !dq[n - i - 1] || dq[n - i - 1] && !dq[i] ||
                dq[i] && dq[n - i - 1] && dq[i]->val != dq[n - i - 1]->val)
            {
                return false;
            }
        }
        return true;
    }
};

层序遍历子树顺序交替：

/*
 * @Author: SourDumplings
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/symmetric-tree/
 * @Date: 2019-03-01 13:12:27
 */

/**
 * 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 isSymmetric(TreeNode *root)
    {
        if (!root)
        {
            return true;
        }

        queue<TreeNode *> q;
        q.push(root->left);
        q.push(root->right);

        while (!q.empty())
        {
            TreeNode *t1 = q.front();
            q.pop();
            TreeNode *t2 = q.front();
            q.pop();
            if (!t1 && !t2)
            {
                continue;
            }
            else if (t1 && !t2 || !t1 && t2 || t1->val != t2->val)
            {
                return false;
            }
            q.push(t1->left);
            q.push(t2->right);
            q.push(t1->right);
            q.push(t2->left);
        }
        return true;
    }
};

递归法： 

 

/*
 * @Author: SourDumplings
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/symmetric-tree/
 * @Date: 2019-03-01 13:12:27
 */

/*
 * @Author: SourDumplings
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: 
 * @Date: 2019-03-01 13:25:58
 */

/**
 * 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 isSymmetric(TreeNode *root)
    {
        bool ret = true;
        if (root)
        {
            ret = equal(root->left, root->right);
        }
        return ret;
    }

    bool equal(TreeNode *t1, TreeNode *t2)
    {
        if (!t1 && !t2)
        {
            return true;
        }
        else if (t1 && !t2 || !t1 && t2 || t1->val != t2->val)
        {
            return false;
        }
        else
        {
            return equal(t1->left, t2->right) && equal(t1->right, t2->left);
        }
    }
};