Skip to content

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

Open
@Niyati3031

Description

@Niyati3031

Can you please assign this to me for hacktoberfest 2023

Activity

welcome

welcome commented on Sep 30, 2023

@welcome

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.

Praful224

Praful224 commented on Oct 1, 2023

@Praful224

Can you please assign this to me for hacktoberfest 2023

GouravRusiya30

GouravRusiya30 commented on Oct 1, 2023

@GouravRusiya30
Member

Done

aryan-rohit

aryan-rohit commented on Oct 7, 2023

@aryan-rohit

@GouravRusiya30 assign this issue to me

iakshatgandhi

iakshatgandhi commented on Oct 26, 2023

@iakshatgandhi

assign to me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

Milestone

No milestone

Relationships

None yet

    Development

    No branches or pull requests

      Participants

      @GouravRusiya30@Niyati3031@Praful224@iakshatgandhi@aryan-rohit

      Issue actions

        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]. · Issue #409 · codedecks-in/LeetCode-Solutions