题目:https://leetcode-cn.com/problems/same-tree/submissions/
答案:
二叉树:
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null){
if(q==null) return true;
else return false;
}else{
if(q==null) return false;
else{
return (p.val == q.val) && (isSameTree(p.left,q.left)) && (isSameTree(p.right,q.right));
}
}
}