[Leetcode 101, Easy] Symmetric Tree

最新推荐文章于 2022-10-10 22:52:42 发布

simplify2012

最新推荐文章于 2022-10-10 22:52:42 发布

阅读量425

点赞数

分类专栏： Leetcode_easy 文章标签： leetcode c++ Tree

本文链接：https://blog.csdn.net/u012212811/article/details/45145833

版权

Leetcode_easy 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

Problem:

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.

Analysis:

Solutions:

C++:

    bool isSymmetric(TreeNode *root) {
        if(root == NULL)
            return true;

        queue<TreeNode *> left_subtree_visited;
        TreeNode *pLeftCurrNode = root->left;

        queue<TreeNode *> right_subtree_visited;
        TreeNode *pRightCurrNode = root->right;
        
        while(pLeftCurrNode != NULL || pRightCurrNode != NULL || !left_subtree_visited.empty() || !right_subtree_visited.empty()) {
            if(pLeftCurrNode == NULL && pRightCurrNode == NULL) {
                pLeftCurrNode = left_subtree_visited.front();
                left_subtree_visited.pop();
                pLeftCurrNode = pLeftCurrNode->right;

                pRightCurrNode = right_subtree_visited.front();
                right_subtree_visited.pop();
                pRightCurrNode = pRightCurrNode->left;
            } else if((pLeftCurrNode != NULL && pRightCurrNode == NULL)
                || (pLeftCurrNode == NULL && pRightCurrNode != NULL)
                || (pLeftCurrNode->val != pRightCurrNode->val)) {
                return false;
            } else {
                left_subtree_visited.push(pLeftCurrNode);
                pLeftCurrNode = pLeftCurrNode->left;

                right_subtree_visited.push(pRightCurrNode);
                pRightCurrNode = pRightCurrNode->right;
            }
        }
        
        return true;
    }

Java :

Python: