Terminal Bench Task: Tree Data Structures for Range Queries
Terminal Bench Task: Tree Data Structures for Range Queries: a task in Terminal-Lego-15k (Harbor dataset). You are required to implement and compare four fundamental tree data structures used for range and interval queries: Segment Tree , Interval Tree , Binary Indexed Tree (Fenwick Tree) , and…
The task
You are required to implement and compare four fundamental tree data structures used for range and interval queries: **Segment Tree**, **Interval Tree**, **Binary Indexed Tree (Fenwick Tree)**, and **Range Tree**. This task will test your understanding of their key concepts, applications, and performance…
Part of PrimeIntellect/Terminal-Lego-15k.