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].

kanak22 / CP-DSA-Questions

This is a repository entirely dedicated to all kind of questions ranging from basic DSA to CP. It aims to provide a solution to different questions. 📚

73 stars 128 forks source link

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]. #589

Open Niyati3031 opened 9 months ago

Niyati3031 commented 9 months ago

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.