1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree

Depth-first search (DFS) with the parameters: current node in the binary tree and current position in the array of integers.

When reaching at final position check if it is a leaf node.