Interval Tree An interval tree lets you efficiently store and query 2D intervals or points in the form of [min, max) (they can be extended into higher dimensions in general, but this implementation ...

This repository contains simple implementations of Segment Trees and Interval Trees, which were developed as part of a university project at the Computer Engineering and Informatics Department of the ...