← Questions
Range sum of a binary search tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary search tree and two bounds low and high, return the sum of the values within the inclusive range, skipping subtrees that cannot contain any. Follow-up: answer many range queries on the same unchanging tree faster than walking it each time.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding