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. 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
//开始疏忽了其中一个节点为空的情况，val也忘了比较。。。
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null&&q==null){
            return true;
        }else if(p==null||q==null){
            return false;
        }
        if(p.val==q.val){
            if(isSameTree(p.left,q.left)&&isSameTree(p.right,q.right)){
                return true;
            }else{
                return false;
            }
        }else{
            return false;
        }
    }
}