本题是一道简单的递归题目,想要看两个树是不是相同,就是去看两个树的左子树和右字树以及根节点是否相同
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q == null){
return true;
}
if (p == null && q!=null){
return false;
}
if (p != null && q == null){
return false;
}
boolean equalSelf = p.val == q.val;
boolean equalLeft = isSameTree(p.left,q.left);
boolean equalRight = isSameTree(p.right,q.right);
return equalSelf && equalLeft && equalRight;
}