题意:给定一棵树,判断它是否沿中轴线对称
思路:
每次把同时遍历根的左右子树,分别对比就行了
/**
* 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 == NULL)
return true;
return findL(root->left,root->right);
}
bool findL(TreeNode *lp,TreeNode *rp) {
if(lp == NULL && rp == NULL)
return true;
if(lp == NULL || rp == NULL)
return false;
if(lp->val != rp->val)
return false;
return findL(lp->left,rp->right)&&findL(lp->right,rp->left);
}
};