Leetcode-100. Same Tree

100. Same Tree

 

QuestionEditorial Solution

 My Submissions

 

• Total Accepted: 159908
• Total Submissions: 358174
• Difficulty: Easy
• Contributors: Admin

 

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.

 

Subscribe to see which companies asked this question

 

 

 

code:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p==NULL||q==NULL)
        return q==p;
        if((p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right))
        return true;
        return false;
    }
};