Same Tree

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(null == p && null == q) return true;//判断是否都为null
        else if((null == p && null != q) || (null != p && null == q)) return false;//判断是否有一个为null
        else if(p.val != q.val) return false;//都不是null 进而判断val是否相等
        else return (isSameTree(p.left, q.left) && isSameTree(p.right, q.right));//判断子树是否相等
    }
}