<p>Given a binary tree <code>root</code> and a&nbsp;linked list with&nbsp;<code>head</code>&nbsp;as the first node.&nbsp;</p>

<p>Return True if all the elements in the linked list starting from the <code>head</code> correspond to some <em>downward path</em> connected in the binary tree&nbsp;otherwise return False.</p>

<p>In this context downward path means a path that starts at some node and goes downwards.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/sample_1_1720.png" style="width: 220px; height: 280px;" /></strong></p>

<pre>
<strong>Input:</strong> head = [4,2,8], root = [1,4,4,null,2,2,null,1,null,6,8,null,null,null,null,1,3]
<strong>Output:</strong> true
<strong>Explanation:</strong> Nodes in blue form a subpath in the binary Tree.  
</pre>

<p><strong class="example">Example 2:</strong></p>

<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/sample_2_1720.png" style="width: 220px; height: 280px;" /></strong></p>

<pre>
<strong>Input:</strong> head = [1,4,2,6], root = [1,4,4,null,2,2,null,1,null,6,8,null,null,null,null,1,3]
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> head = [1,4,2,6,8], root = [1,4,4,null,2,2,null,1,null,6,8,null,null,null,null,1,3]
<strong>Output:</strong> false
<strong>Explanation:</strong> There is no path in the binary tree that contains all the elements of the linked list from <code>head</code>.
</pre>

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

<ul>
	<li>The number of nodes in the tree will be in the range <code>[1, 2500]</code>.</li>
	<li>The number of nodes in the list will be in the range <code>[1, 100]</code>.</li>
	<li><code>1 &lt;= Node.val&nbsp;&lt;= 100</code>&nbsp;for each node in the linked list and binary tree.</li>
</ul>

class Solution
{
private:
    ListNode* head;
    bool found = false;

public:
    bool isSubPath(ListNode* const head, 
                   TreeNode* const root)
    {
        this->head = head;

        ListNode* lnodes_next[101] = { };
        int l_next = 0;

        lnodes_next[l_next++] = head;

        this->isSubPathDFS(root, lnodes_next, l_next);

        return found;
    }

    void isSubPathDFS(TreeNode* const tnode, 
                      ListNode** lnodes, const int l)
    {
        ListNode* lnodes_next[101] = { };
        int l_next = 0;

        for (int i = 0; i < l; ++i)
        {
            ListNode* const lnode = lnodes[i];

            if (lnode == nullptr)
            {
                found = true;
                return;
            }

            if (tnode == nullptr)
                continue;

            if (lnode->val == tnode->val)
                lnodes_next[l_next++] = lnode->next;
        }

        if (tnode == nullptr)
            return;

        lnodes_next[l_next++] = head;

        this->isSubPathDFS(tnode->left, lnodes_next, l_next);

        if (found)
            return;

        this->isSubPathDFS(tnode->right, lnodes_next, l_next);

        return;
    }
};

32900