对称的二叉树

 1 bool isSame(TreeNode *pRoot1, TreeNode *pRoot2)
 2 {
 3     if(!pRoot1 && !pRoot2)return true;
 4     if(!pRoot1 || !pRoot2)return false;
 5     if(pRoot1->val != pRoot2->val)return false;
 6     return isSame(pRoot1->left, pRoot2->right) && isSame(pRoot1->right, pRoot2->left);
 7 }
 8 class Solution {
 9 public:
10     bool isSymmetrical(TreeNode* pRoot)
11     {
12         return isSame(pRoot, pRoot);
13     }
14 };