leetcode 100. 相同的树

 1 class Solution {
 2     public boolean isSameTree(TreeNode p, TreeNode q) {
 3         return isSame( p,  q);
 4     }
 5     public boolean isSame(TreeNode p, TreeNode q) {
 6         if(p==null&&q==null){
 7             return true;
 8         }else if(p!=null&&q!=null){
 9             if(p.val!=q.val) return false;
10             return isSame(p.left,q.left)&&isSame(p.right,q.right);
11         }else return false;
12     }
13 }