Given a Binary Search Tree (BST) and a range **l-h(inclusive)**, count the number of nodes in the BST that lie in the given range.

- The values smaller than root go to the left side
- The values greater and equal to the root go to the right side

**Input Format:**

The first line of the input contains an integer **'T'** denoting the number 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 no 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, where** l < h**

**Output:**

For each testcase, in a new line, output the number of nodes that lie in the range l-h.

**Your Task:**

This is a function problem. You don't have to take input. You are required to complete the function **getCountOfNode() **that takes root, l ,h as parameters and returns the **count**.

**Constraints:**

1 <= T <= 100

1 <= N <= 100

1 <= l < h < 10^{3}

**Example:
Input:**

2

6

10 5 50 1 40 100

5 45

5

5 6 7 4 3

2 8

**Output:**

3

5

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.

d_Coder00 | 163 |

VivSisMMM | 152 |

Astikeysingh | 148 |

Reetu_Kumari_MIT2018056 | 132 |

dungeon_master1299 | 126 |

Pulkit__Sharma__ | 658 |

Anirban166 | 531 |

abducodes | 518 |

Found_me | 494 |

Sathvik Avasarala | 466 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.