Login

All Problems

Problem title

Difficulty

Avg time to solve

Check Permutation

Easy

15 mins

Ninja and his Courses

Hard

50 mins

Power Set

Easy

15 mins

Is Graph Tree?

Easy

15 mins

Exactly One Child

Easy

15 mins

Find Peak Element

Easy

15 mins

Redundant Brackets

Easy

15 mins

Number Game

Hard

10 mins

Interleaving Two Strings

Moderate

45 mins

Floor in BST

Moderate

30 mins

Problem

Submissions

6

Difficulty: MEDIUM

Avg. time to solve

30 min

Success Rate

70%

Problem Statement

```
In the above example, For the given BST and X = 7, the greatest value node of the BST which is smaller than or equal to 7 is 6.
```

```
The first line of input contains an integer ‘T’, denoting the number of test cases. Then each test case follows.
The first line of each test case contains nodes in level order form (separated by space). If any node does not have a left or right child, take -1 in its place.
The second and the last line of each test case contain integer ‘X’.
For example, the input for the tree depicted in the below image.
```

```
10
5 15
2 6 -1 -1
-1 -1 -1 -1
```

```
Level 1 :
The root node of the tree is 10
Level 2 :
Left child of 10 = 5
Right child of 10 = 15
Level 3 :
Left child of 5 = 2
Right child of 5 = 6
Left child of 15 = null(-1)
Right child of 15 = null (-1)
Level 4 :
Left child of 2 = null (-1)
Right child of 2 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null(-1).
```

```
The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:
10 5 15 2 6 -1 -1 -1 -1 -1 -1
```

```
For each test case, print a single integer ‘M’, denoting the greatest value node of the BST which is smaller than or equal to ‘X’.
The Output of each test case will be printed on a separate line.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 5
1 <= N <= 5 * 10 ^ 3
1 <= nodeVal[i] <= 10 ^ 9
Time Limit: 1 sec.
```

```
2
10 5 15 2 6 -1 -1 -1 -1 -1 -1
7
2 1 3 -1 -1 -1 -1
2
```

```
6
2
```

```
In the first test case, the BST looks like as below:
```

```
The greatest value node of the BST which is smaller than or equal to 7 is 6.
In the second test case, the BST looks like as below:
```

```
The greatest value node of the BST which is smaller than or equal to 2 is 2.
```

```
2
5 3 10 2 4 6 15 -1 -1 -1 -1 -1 -1 -1 -1
15
5 3 10 2 4 6 15 -1 -1 -1 -1 -1 -1 -1 -1
8
```

```
15
6
```

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Language

Change Theme

Solution submission not allowed

Save Code

Reset Code