A more detailed explanation of the range tree, possibly with a C ++ implementation?

Question

I am trying to learn more data structures for programming contests. I looked / implemented a segment tree, but many solutions on topcoder / other forums refer to the "range tree". None of these solutions go deeper depending on what they do or how the "range tree" (in particular, 2-dimensional) works. The only relatively useful link I found is (http://www.cise.ufl.edu/class/cot5520fa09/CG_RangeTrees.pdf), but it seems very wide.

A lot of example code is concise because it was encoded in a contest environment, and is it also difficult to read library code due to templates, among others?

Can someone give a brief explanation of the 2nd range tree? (e.g. how to store / present it, functionality, etc.).

From my readings, I understand that it can pretty much store any aggregate range characteristic, such as a segment tree (?)

thanks

Answer 1

I will bring you to lecture 3 at http://courses.csail.mit.edu/6.851/spring12/lectures/