572. 另一棵树的子树

572. 另一棵树的子树

---

题目链接：572. 另一棵树的子树

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution 
{
public:
	bool isSubtree(TreeNode* root, TreeNode* subRoot)
	{
		if (root == nullptr) { return false; }

		return isSame(root, subRoot) ||
			isSubtree(root->left, subRoot) ||
			isSubtree(root->right, subRoot);
	}

private:
	bool isSame(TreeNode* p, TreeNode* q)
	{
		if (p == nullptr && q == nullptr) { return true; }
		if (p == nullptr || q == nullptr) { return false; }
		return (p->val == q->val) &&
			isSame(p->left, q->left) &&
			isSame(p->right, q->right);
	}
};