小白笔记----------------------leetcode(100 Same Tree)

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.

考虑到每个叶子节点比较的可能性，一共三种情况，比较完之后再比较值，只有最后都遍历到空节点，才是同一颗树

. /**
 * Definition for a binary tree node.
 * 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(p == null && q == null){
            return true;
        }
        if(p == null && q != null){
            return false;
        }
        if(p != null && q== null){
            return false;
        }
        if(q.val != p.val){
            return false;
        }else{
           return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
        }
        
    }
}