Given a Binary Search Tree **(BST) **and a range, print all the numbers in the BST that lie in the given range **l-h(inclusive)** in** non-decreasing order.** If no such element exists**, an empty line will be printed**.

**Note:** Element greater than or equal to root go to the right side.

**Input Format:**

The first line of the input contains an integer **'T' **denoting the nummber of test cases. Then** 'T' **test cases follow. Each test case consists of **three **lines. Description of test cases is as follows:

The First line of each test case contains an integer **'N' **which denotes the number of nodes in the BST. .

The Second line of each test case contains **'N' space separated values** of the nodes in the BST.

The Third line of each test case contains** two space separated integers 'l' and 'h'** denoting the **range**.

**Output Format:**

For each testcase, in a new line, print print all the numbers in the BST that lie in the given range in** non-decreasing order.**

**Your Task:**

This is a function problem. You don't have to take any input. Complete the function **printNearNodes()** that takes root, l, h as parameters and prints numbers in the BST that lie in the given range in** non-decreasing order.**

**Constraints:**

1 <= T <= 100

1 <= N <= 50

1 <= l < h < 1000

**Example:
Input:**

2

6

10 5 50 1 40 100

5 45

4

5 6 3 2

1 4

**Output:**

5 10 40

2 3

**Explanation:
Testcase 1:** Elements which are in the range of 5 and 45(inclusive) are 5 10 40.

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

preparecodinginterview_dot_com | 190 |

hari32147 | 162 |

JonSnow_IKnowNothing | 160 |

AdityaRaj9 | 112 |

shivamsingh00236 | 111 |

abducodes | 906 |

harshtyagi36 | 447 |

arpit_anshuman | 335 |

vamsikrishna55 | 323 |

sandipbhaumik | 321 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.