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.

Subscribeto see which companies asked this question.

Hide Tags

Tree

Depth-first Search

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

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.val == q.val) 
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        return false;
    }
}