Implement interval-based algorithms

Create implementations for interval-based algorithms and data structures:

## Data structures:
- Interval tree
- Segment tree
- Binary indexed tree (Fenwick tree)

## Problems to solve:
- Merge overlapping intervals
- Insert interval
- Non-overlapping intervals
- Meeting rooms problem
- Range queries (sum, min, max)
- Range updates
- Skyline problem

## Requirements:
- Provide detailed complexity analysis
- Create comprehensive test cases
- Include visualizations where appropriate
- Document practical applications

This collection will demonstrate efficient techniques for handling interval-based problems, which are common in scheduling, computational geometry, and range-based data analysis.