LeetCode之Symmetric Tree

最新推荐文章于 2020-06-29 10:00:06 发布

wteo

最新推荐文章于 2020-06-29 10:00:06 发布

阅读量959

点赞数

分类专栏： LeetCode leetcode

本文链接：https://blog.csdn.net/smileteo/article/details/22984551

版权

LeetCode 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

leetcode

46 篇文章 0 订阅

订阅专栏

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.

/**
 * Definition for binary tree
 * 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 *> lstack, rstack;
		 lstack.push(root->left);
		 rstack.push(root->right);
		 while (!lstack.empty() && !rstack.empty()){
			 TreeNode * node1 = lstack.top();
			 TreeNode * node2 = rstack.top();
			 lstack.pop();
			 rstack.pop();
			 if (!node1 && !node2)  continue;
			 if (!node1 || !node2) return false;
			 if (node1->val != node2->val) return false;
			 lstack.push(node1->left);
			 lstack.push(node1->right);
			 rstack.push(node2->right);
			 rstack.push(node2->left);
		 }
		 return true;
    }
    

    
    
/****************************************************************************
    bool isSymmetric(TreeNode *root) {
        if(!root) return true;
        return help(root->left, root->right);
    }

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