leetcode-简单题-100. 相同的树

https://leetcode-cn.com/problems/same-tree/submissions/
这还是写不出来，害

//递归调用
//传入参数：两个树的节点
//终止条件：两个树为null,一边没有，节点值不等
//内部逻辑：
//对比左子节点，右节点
//中左右
//
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == null && q == null) return true;
        else if(p != null && q == null) return false;
        else if(p == null && q != null) return false;
        else if(p.val != q.val) return false;
        boolean left,right;
        left = isSameTree(p.left, q.left);
        right = isSameTree(p.right, q.right);
        boolean res = left && right;
        return res;
    }
}