思路:分类讨论,递归
public boolean isSameTree(TreeNode p, TreeNode q) {
return isSameTreeUtil(p,q);
}
boolean isSameTreeUtil(TreeNode p, TreeNode q){
if(p==null && q==null){
return true;
}else if(p!=null && q!=null){
if(p.val == q.val){
return isSameTreeUtil(p.left,q.left) && isSameTreeUtil(p.right,q.right);
}else{
return false;
}
}else{
return false;
}
}