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.
Input: 10 / \ 5 50 / / \ 1 40 100 l = 5, h = 45 Output: 3 Explanation: 5 10 40 are the node in the range
Input: 5 / \ 4 6 / \ 3 7 l = 2, h = 8 Output: 5 Explanation: All the nodes are in the given range.
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.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(Height of the BST).
1 <= Number of nodes <= 100
1 <= l < h < 103
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.