给定一个二叉树,判定其是否为左右对称的结构。参考答案有两种方法:1.子函数调用,递归实现 2. 运用栈的结构,递归实现。 方法一更简洁明了。
/**
* 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;
return helper(root->left, root->right);
}
bool helper(TreeNode* p, TreeNode* q)
{
if(!p && !q) return true;
else if(!p || !q) return false;
if(p->val != q->val)return false;
return helper(p->left, q->right) && helper(p->right, q->left);
}
};
/
class Solution {
public:
bool isSymmetric(TreeNode* root) {
TreeNode* left, *right;
if(!root) return true;
queue<TreeNode*> p, q;
p.push(root->left);
q.push(root->right);
while(!p.empty() && !q.empty())
{
left = p.front();
p.pop();
right = q.front();
q.pop();
if(!left && !right) continue;
else if(!left || !right) return false;
if(left->val != right->val) return false;
p.push(left->left);
p.push(left->right);
q.push(right->right);
q.push(right->left);
}
return true;
}
};