Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

Your friends gifted you a lot of things on your birthday, and now it's your turn to give some return gifts to them. You went to a gift store and decided to buy some Binary Search Trees (BST).

There is no salesperson in the store. So you are supposed to guess the price of a given BST, which is the minimum value in its nodes.

Detailed explanation

```
1 <= 'T' <= 10
1 <= 'N' <= 10^5
1 <= A[i] <= 10^6 or A[i] = -1, i ∈ (1, N)
Note - The sum of 'N' over all test cases does not exceed 2 * 10^5.
Time Limit: 1 sec
```

```
2
13
5 4 6 3 -1 -1 7 1 -1 -1 -1 -1 -1
7
9 -1 10 -1 11 -1 -1
```

```
1
9
```

```
For Case 1:
```

```
Given input looks like the tree drawn above. It can be seen that the minimum value in the tree is 1.
For Case 2:
```

```
Given input looks like the tree drawn above. It can be seen that the minimum value in the tree is 9.
```

```
2
7
20 8 22 -1 -1 -1 -1
15
40 9 50 4 12 -1 -1 -1 -1 10 14 -1 -1 -1 -1
```

```
8
4
```