A **Binary Search Tree (BST)** is a tree data structure where each node has at most two children, referred to as the left and right children. The left child’s value is less than the parent node’s value, and the right child’s value is greater than the parent node’s value.
active 2025-01-18 → 2025-01-18 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2025-01-18 to 2025-01-18. 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: 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 |
|---|---|---|---|---|
| fix2015 | 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 — 1 stars here means stars gained during the window, not the repo's star count.