题解 | #对称的二叉树#

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    bool isSymmetrical(TreeNode* pRoot) {
         return isSame(pRoot,pRoot);
    }
    
    //采用递归的方法遍历左右根节点
    bool isSame(TreeNode *pRoot1,TreeNode *pRoot2){
        if(!pRoot1&&!pRoot2){
            return true;
        }
        if(!pRoot1||!pRoot2){
            return false;
        }
        return pRoot1->val==pRoot2->val&&
            //递归
            isSame(pRoot1->right,pRoot2->left)
            &&isSame(pRoot1->left,pRoot2->right);
    }

};