Skip to content
/ itree Public

This code covers the process of building an interval tree, an ordered tree structure that holds intervals and allows to efficiently find all intervals that overlap with any given interval or point.

Notifications You must be signed in to change notification settings

khan5v/itree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

itree

This code covers the process of building an interval tree, an ordered tree structure that holds intervals and allows to efficiently find all intervals that overlap with any given interval or point.

About

This code covers the process of building an interval tree, an ordered tree structure that holds intervals and allows to efficiently find all intervals that overlap with any given interval or point.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages