Associated Course(s):
Sudo Placement [IITs]

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**.

**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**

1

6

10 5 50 1 40 100

5 45

5 10 40

Author: Shubham Joshi 1

blackshadows | 242 |

xmyqsh | 216 |

hanuman001 | 172 |

Adarsh Trivedi | 168 |

layman_brother | 168 |

blackshadows | 724 |

xmyqsh | 557 |

aman19 | 402 |

r0c2048 | 360 |

kspk | 331 |

akhayrutdinov | 5005 |

Ibrahim Nash | 4871 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3228 |

Login to report an issue on this page.