100. 相同的树

解体思路：

判定条件有两个：① 两棵树结构相同 ② 结点的值相同 

public boolean isSameTree(TreeNode p, TreeNode q) {
		if (p == null && q == null) {
			return true;
		}
		
		if (p == null || q == null) {
			return false;
		}
		
		if (p.val != q.val) {
			return false;
		}
		
		boolean left = isSameTree(p.lefNode,  q.lefNode);
		boolean right = isSameTree(p.rightNode,  q.rightNode);
		
		return left && right;
}