<p>Given the roots of two binary trees <code>root</code> and <code>subRoot</code>, return <code>true</code> if there is a subtree of <code>root</code> with the same structure and node values of<code> subRoot</code> and <code>false</code> otherwise.</p>

<p>A subtree of a binary tree <code>tree</code> is a tree that consists of a node in <code>tree</code> and all of this node&#39;s descendants. The tree <code>tree</code> could also be considered as a subtree of itself.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/subtree1-tree.jpg" style="width: 532px; height: 400px;" />
<pre>
<strong>Input:</strong> root = [3,4,5,1,2], subRoot = [4,1,2]
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/subtree2-tree.jpg" style="width: 502px; height: 458px;" />
<pre>
<strong>Input:</strong> root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The number of nodes in the <code>root</code> tree is in the range <code>[1, 2000]</code>.</li>
	<li>The number of nodes in the <code>subRoot</code> tree is in the range <code>[1, 1000]</code>.</li>
	<li><code>-10<sup>4</sup> &lt;= root.val &lt;= 10<sup>4</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= subRoot.val &lt;= 10<sup>4</sup></code></li>
</ul>

/**
 * 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:
    int getDepth(TreeNode* node, std::vector<TreeNode*>& nodes, int depth)
	{
		if (!node)
			return -1;

		int maxDepth = std::max(getDepth(node->left, nodes, depth), getDepth(node->right, nodes, depth)) + 1;
		if (maxDepth == depth)
			nodes.push_back(node);

		return maxDepth;
	}

	bool identical(TreeNode* t1, TreeNode* t2)
	{
		if (!t1 && !t2)
			return true;
		if (!t1 || !t2 || t1->val != t2->val)
			return false;

		return identical(t1->left, t2->left) && identical(t1->right, t2->right);
	}

	// Solution 2: Checking identical trees
	bool isSubtree(TreeNode* t1, TreeNode* t2)
	{
		if (!t1 && !t2)
			return true;
		if (!t1 || !t2)
			return false;

		std::vector<TreeNode*> t1Nodes{};
		int t2Depth = getDepth(t2, t1Nodes, -1);
		int t1Depth = getDepth(t1, t1Nodes, t2Depth);

		for (TreeNode* n : t1Nodes)
			if (identical(n, t2))
				return true;

		return false;
	}
};
29500