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.
給定兩棵非空二叉樹s和t，判定t是否為s的一棵子樹。

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.

思路
遞歸思想，本節(jié)點不滿足時則取兩個子節(jié)點判定結果的邏輯或，本節(jié)點滿足時則判定兩個子節(jié)點結果的邏輯與。

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