How should I practice Root-to-Node Path in a Binary Tree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Root-to-Node Path in a Binary Tree associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Root-to-Node Path in a Binary Tree

Learn this problem

● Easy

AmazonFULLTIMEONSITE INTERVIEW

See Amazon hiring insights

Problem statement

Given the root of a binary tree whose node values are unique and an integer target, return the node values along the path from the root to the node whose value equals target, including both endpoints.

If the target does not appear in the tree, return an empty array.

Function

rootToNodePath(root: TreeNode, target: int) → int[]

Examples

Example 1

root = [1,2,3,4,5,null,6]target = 5return = [1,2,5]

Starting at 1, move left to 2 and then right to 5.

Example 2

root = [7]target = 7return = [7]

The root is the target, so the path contains one value.

Example 3

root = [1,2,3]target = 9return = []

No node has value 9.

Constraints

The tree contains from 0 through 10^5 nodes.
-10^9 <= Node.val, target <= 10^9.
All node values are unique.