Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null)
return true;
if(p==null||q==null) // 若兩個都為空的話敦跌，則上面一個判斷已經(jīng)返回了true的結(jié)果
return false;
return p.val == q.val&&isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
}
}
