Same Tree

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {

    bool judge(TreeNode *left,TreeNode *right){
        if(left==NULL&right==NULL)return true;
        if(left!=NULL&&right!=NULL){
            if(left->val==right->val)
                return judge(left->left,right->left)&&judge(left->right,right->right);
        }
        return false;
    }

        

public:
    bool isSameTree(TreeNode *p, TreeNode *q) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return judge(p,q);
        
    }
};