Range sum of a binary search tree

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.