We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given a binary search tree and a range [a, b] (inclusive), return the sum of the elements of the binary search tree within the range.
[a, b]
For example, given the following tree:
5 / \ 3 8 / \ / \ 2 4 6 10
and the range [4, 9], return 23 (5 + 4 + 6 + 8).
[4, 9]
23
(5 + 4 + 6 + 8)
The text was updated successfully, but these errors were encountered:
vaskoz
Successfully merging a pull request may close this issue.
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given a binary search tree and a range
[a, b]
(inclusive), return the sum of the elements of the binary search tree within the range.For example, given the following tree:
and the range
[4, 9]
, return23
(5 + 4 + 6 + 8)
.The text was updated successfully, but these errors were encountered: