check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree

< Previous 　　　　　　　　　　　　　　　　 Next >

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

Related Topics

[Tree] [Depth-First Search] [Breadth-First Search] [Binary Tree]

Hints

Hint 1

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

Hint 2

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