Associated Course(s):
Interview Preparation

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 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 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 <= 50

1 <= N <= 50

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

**Example:
Input**

1

6

10 5 50 1 40 100

5 45

**Output**

3

Author: Shubham Joshi 1

blackshadows | 242 |

layman_brother | 234 |

xmyqsh | 220 |

Adarsh Trivedi | 205 |

hanuman001 | 200 |

blackshadows | 724 |

xmyqsh | 561 |

aman19 | 402 |

r0c2048 | 360 |

mb1973 | 335 |

akhayrutdinov | 5005 |

Ibrahim Nash | 4875 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3228 |

Login to report an issue on this page.