Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

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
10 tasks
Niyati3031 opened this issue Sep 30, 2023 · 1 comment
Open
10 tasks

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

Niyati3031 opened this issue Sep 30, 2023 · 1 comment

Comments

@Niyati3031
Copy link
Contributor

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
Copy link
Contributor Author

Can you please assign this to me for hacktoberfest 2023

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Niyati3031