A self-balancing binary search tree for mapping discrete, disjoint segments to values.
-
Updated
Aug 23, 2020 - Rust
A self-balancing binary search tree for mapping discrete, disjoint segments to values.
Rust library for data structures
CPC - Competitive Programming and Contests - Project: Segment tree
Data structure of segment tree
Add a description, image, and links to the segment-tree topic page so that developers can more easily learn about it.
To associate your repository with the segment-tree topic, visit your repo's landing page and select "manage topics."