【Symmetric Tree】cpp

最新推荐文章于 2024-12-25 21:50:53 发布

weixin_34198797

最新推荐文章于 2024-12-25 21:50:53 发布

阅读量59

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/xbf9xbf/p/4505116.html

本文探讨如何使用递归和迭代方法判断二叉树是否对称，涉及二叉树数据结构、栈操作及同题转换策略。

题目：

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

For example, this binary tree is symmetric:

But the following is not:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

代码：

/**
 * 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;
            stack<TreeNode *> staL, staR;
            staL.push(root->left);
            staR.push(root->right);
            while ( !staL.empty() && !staR.empty() )
            {
                TreeNode *tmpL = staL.top();
                staL.pop();
                TreeNode *tmpR = staR.top();
                staR.pop();
                if ( !tmpL && !tmpR ) continue;
                if ( !tmpL || !tmpR ) return false;
                if ( tmpL->val != tmpR->val ) return false;
                staL.push(tmpL->right);
                staL.push(tmpL->left);
                staR.push(tmpR->left);
                staR.push(tmpR->right);
            }
            return staL.empty() && staR.empty();
    }
};