I want to add solution of leetcode problem- 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].

Question

Niyati3031 opened this issue 2 years ago · 5 comments

Can you please assign this to me for hacktoberfest 2023

Done

Answer 1 · 2023-09-30T15:10:15.000Z

Thanks for helping us improve and opening your first issue here! Don't forget to give us a 🌟 to support us.

While you're waiting, I just wanted to make sure you've had a chance to look at our Readme and Pull Request Guidelines.

Answer 2 · 2023-10-01T07:39:28.000Z

Can you please assign this to me for hacktoberfest 2023

Answer 3 · 2023-10-07T03:27:14.000Z

@GouravRusiya30 assign this issue to me

Answer 4 · 2023-10-26T11:50:31.000Z

assign to me