解题思路:
(1)参考牛客网,先左后右和先右后左的序列如果一样,那么该二叉树是对称的
/*
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 Judge(pRoot,pRoot);
}
bool Judge(TreeNode *root1, TreeNode *root2) {
if(root1==NULL && root2==NULL) return true;
if(root1==NULL || root2==NULL) return false;
if(root1->val!=root2->val) return false;
else return Judge(root1->left,root2->right)&&Judge(root1->right,root2->left);
}
};