[leetcode]572. Subtree of Another Tree

[leetcode]572. Subtree of Another Tree

---

Analysis

中午可以吃胡萝卜和肉肉啦~—— [在家就是爽~]

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’s descendants. The tree s could also be considered as a subtree of itself.
找到相等的节点，然后判断剩下的子树和目标树是否相同。

Implement

/**
 * 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 false;
        if(s->val == t->val && judge(s, t))
            return true;
        else
            return isSubtree(s->left, t) || isSubtree(s->right, t);
        return false;
    }
    bool judge(TreeNode* s, TreeNode* t){
        if(!s && !t)
            return true;
        if(!s || !t)
            return false;
        if(s->val == t->val)
            return judge(s->left, t->left) && judge(s->right, t->right);
        else
            return false;
    }
};