/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
boolean isSymmetrical(TreeNode pRoot) {
if (null == pRoot) {
return true;
}
return isSame(pRoot.left, pRoot.right);
}
public boolean isSame(TreeNode left, TreeNode right) {
if (left == null && right == null) {
return true;
}
if (left == null && right != null) {
return false;
}
if (left != null && right == null) {
return false;
}
if (left.val != right.val) {
return false;
}
boolean leftTree = isSame(left.left, right.right);
boolean rightTree = isSame(left.right, right.left);
return leftTree && rightTree;
}
}