Same Tree [LEETCODE]

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.

======================================================================

Easy recursive solution , accepted with one submission.

/**
* Definition for binary tree
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(NULL == p && NULL == q){
return true;
}
if(NULL == p || NULL == q){
return false;
}
if(p->val != q->val){
return false;
}
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
};