leetCode572

有点想玩痒痒鼠，反正我一个sp都没有。。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSubtree(TreeNode* s, TreeNode* t) {
        if(s) return isSame(s,t) || isSubtree(s->left,t) || isSubtree(s->right,t);
        else return isSame(s,t);
    }
    
    bool isSame(TreeNode* s,TreeNode* t)
    {
        if(!s && !t) return 1;
        else if(s && t) return s->val == t->val && isSame(s->left,t->left) && isSame(s->right,t->right);
        else return 0;
    }
};