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