Sum of Values in BST Range

Given a binary search tree (BST) and a range [low, high], calculate the sum of all the values in the BST that fall within this range. Write a program that reads a series of integers representing the values of nodes in the BST, followed by two integers indicating the range limits. The first integer in the series is the root node of the BST, and subsequent integers are inserted according to the rules of a BST. Input format: - The first line contains integers separated by spaces, representing values to be inserted into the BST. - The second line contains two integers, low and high, separated by a space. Output format: - Output the sum of all values in the BST that fall within the range [low, high]. Example: Input: 10 5 15 3 7 18 7 15 Output: 32