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.

/**

 * 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 status;

    void helper(TreeNode *p, TreeNode * q){
        if (status==false)
            return;
            
        if ((p==NULL && q!=NULL) ||
            (p!=NULL && q==NULL)){
                status = false;
                return;
            }
        else if (p==NULL & q==NULL)
            return;    
        else if(p->val == q->val){
            helper(p->left, q->left);
            helper(p->right, q->right);
        }
        else{
            status = false;
            return;
        }
    }

    bool isSameTree(TreeNode *p, TreeNode *q) {
        
        status = true;
        
        helper(p, q);
        
        return status;
    }
};