An AVL tree is a form of self-balancing binary search tree. It can efficiently store and query sortable values (e.g. integers or strings). An interval tree lets you efficiently store and query 2D ...

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 ...