In ALX, binary trees in C are hierarchical data structures comprising nodes, each with at most two children: left and right. Nodes store data, facilitating efficient search, insertion, and deletion operations. ALX programs leverage C's flexibility to implement binary trees for diverse applications, enhancing data organization and retrieval.
active 2023-11-27 → 2024-03-07 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 102 days from 2023-11-27 to 2024-03-07. Pushes: 14 total, peak 6 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: 1 total, peak 1 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 |
|---|---|---|---|---|
| Abdeljalil37 | 12 | 12 | 0 | 0 |
| shixyman | 2 | 2 | 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 — 1 stars here means stars gained during the window, not the repo's star count.