LeetCode --- Same Tree

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.

---

My Submitted Code

/**
 * 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) {
        if(!p && !q){
            return true;
        }
        else if(!p){
            return false;
        }else if(!q){
            return false;
        }
        bool lret,rret;
        if(p->val == q->val){
            lret = isSameTree(p->left,q->left);
            rret = isSameTree(p->right,q->right);
            return lret && rret;
        }else{
            return false;
        }

    }
};