Data Structure & Algorithms notes - comes in handy if you are currently taking a Data Structures and Algorithms course
python3 implementation of trees. Including AVL Tree, Interval Tree and More.
A library for aggregating values assigned to indices by slices and the other way around
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 University of Patras. They include functions for range and stabbing queries.
DSA Project about application of Interval Trees
implementation of my thesis
Generic tools to support parsing gtf/gff files and identifying overlapping genomic regions
Course curriculum designed for a Graduate Software Engineering Class
Add a description, image, and links to the interval-tree topic page so that developers can more easily learn about it.
To associate your repository with the interval-tree topic, visit your repo's landing page and select "manage topics."