572. Subtree of Another Tree

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.

Example 1:
Given tree s:

     3
    / \
   4   5
  / \
 1   2

Given tree t:

   4 
  / \
 1   2

Return  true, because t has the same structure and node values with a subtree of s.

Example 2:
Given tree s:

     3
    / \
   4   5
  / \
 1   2
    /
   0

Given tree t:

   4
  / \
 1   2

Return  false.

递归：

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

BFS

/**
 * 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){
            if(t){
                return false;
            }else{
                return true;
            }
        }
        queue<TreeNode*> q;
        q.push(s);
        while(!q.empty()){
            TreeNode* temp = q.front();
            q.pop();
            
            bool ret = isSameTree(temp, t);
            if(ret){
                return true;
            }
            
            if(temp->left) q.push(temp->left);
            if(temp->right) q.push(temp->right);
        }
        return false;
    }
    
    bool isSameTree(TreeNode* s, TreeNode* t){
        if(s == nullptr && t == nullptr){
            return true;
        }
    
        if((s == nullptr && t != nullptr) || (s != nullptr && t == nullptr)){
            return false;
        }
        
        if(s->val != t->val){
            return false;
        }
        
        return isSameTree(s->left, t->left) && isSameTree(s->right, t->right);
    }
    
};