A generic binary search tree that maintains balance by restructuring subtrees at height ≥3 if one subtree has twice as many elements as the other. Rebalancing uses a sorted array to create an ideally balanced subtree. Insertions and deletions needing rebalancing may temporarily exceed 𝑂 ( log 𝑛 ) O(logn) complexity.
active 2024-12-08 → 2024-12-08 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-12-08 to 2024-12-08. Pushes: 3 total, peak 3 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Robi-GH | 3 | 3 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.