判断一棵二叉树是否对称。
下图的二叉树就是对称的:
1
/ \
2 2
/ \ / \
3 4 4 3
而下图的二叉树就是非对称的:
1 / \ 2 2 \ \ 3 3分别用递归和非递归的方法实现:
递归法:
/**
* 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) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(root == NULL) return true;
return judge(root->left, root->right);
}
bool judge(TreeNode *p, TreeNode *q){
if(p == NULL && q == NULL)
return true;
else if(p != NULL && q != NULL && p->val == q->val)
return judge(p->left, q->right) && judge(p->right, q->left);
else return false;
}
};
非递归法:
/**
* 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) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(root == NULL) return true;
queue<TreeNode*> q;
q.push(root->left);
q.push(root->right);
TreeNode *t1, *t2;
while(!q.empty()){
t1 = q.front();
q.pop();
t2 = q.front();
q.pop();
if(t1 == NULL && t2 == NULL)
continue;
if(t1 == NULL || t2 == NULL || t1->val != t2->val)
return false;
q.push(t1->left);
q.push(t2->right);
q.push(t1->right);
q.push(t2->left);
}
return true;
}
};