Range Sum of BST: Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high].

[Niyati3031]

Link of the question

Provide the link of the question and ask for assignment of the issue.

Coding platform

• [ ] Hackerrank
• [ ] HackerEarth
• [ ] Codechef
• [ ] Codeforces
• [✅ ] Leetcode
• [ ] InterviewBit
• [ ] AtCoder
• [ ] 450 DSA Sheet

Programming language

• [ ] C
• [ ] C++
• [ ] Java
• [✅ ] Python

Additional context (OPTIONAL)

Add any other context or screenshots about the feature request here.

[Niyati3031]

Can you please assign this to me for hacktoberfest 2023