**Problem Description**

Given a Binary Tree **A** containing **N** nodes.

You need to find the path from **Root** to a given node **B**.

**NOTE:**

- No two nodes in the tree have same data values.
- You can assume that
**B**is present in the tree**A**and a path always exists.

1 <= N <= 10^{5}

1 <= Data Values of Each Node <= N

1 <= B <= N

First Argument represents pointer to the root of binary tree **A**.

Second Argument is an integer **B** denoting the node number.

Return an one-dimensional array denoting the path from **Root** to the node **B** in order.

Input 1:

A =

1 / \ 2 3 / \ / \ 4 5 6 7B = 5

Input 2:

A = 1 / \ 2 3 / \ . \ 4 5 . 6B = 1

Output 1:

[1, 2, 5]

Output 2:

[1]

Explanation 1:

We need to find the path from root node to node with data value 5. So the path is1 -> 2 -> 5so we will return [1, 2, 5]

Explanation 2:

We need to find the path from root node to node with data value 1. As node with data value 1 is the root so there is only one node in the path. So we will return [1]

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

- Hint 1
- Solution Approach
- Complete Solution

Loading...