class Solution {
public boolean checkSymmetricTree(TreeNode root) {
return myJudge(root, root);
}
public boolean myJudge(TreeNode root1, TreeNode root2) {
if (root1 == null && root2 == null) {
return true;
} else if (root1 == null || root2 == null) {
return false;
} else {
return (root1.val == root2.val) && myJudge(root1.left, root2.right) && myJudge(root1.right, root2.left);
}
}
}
##Solution1:
书上的思路就挺好的
书中的思路:针对二叉树的前序遍历,定义一种遍历算法,先遍历右子结点再遍历左子结点,并考虑进NULL的情况
/*
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 JudgeSym(pRoot, pRoot);
}
bool JudgeSym(struct TreeNode *pRoot1, struct TreeNode *pRoot2) {
if(pRoot1 == NULL && pRoot2 == NULL)
return true;
if(pRoot1 == NULL || pRoot2 == NULL)
return false;
if(pRoot1->val != pRoot2->val)
return false;
return JudgeSym(pRoot1->left, pRoot2->right) && JudgeSym(pRoot1->right, pRoot2->left);
}
};