leetcode--demo100相同的树

leetcode–demo100相同的树

这条题我用的是深度优先如果使用广度优先将需要两个队列，相对比较麻烦。

class TreeNode {
    
    
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode() {
    
    
    }

    TreeNode(int val) {
    
    
        this.val = val;
    }

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