MahmoudAymann2/Simple-Dictionary-Using-Binary-Search-Tree-BST-
View on GitHub ↗Related repositories →This project implements a simple dictionary using a Binary Search Tree (BST) in C++. The dictionary allows users to perform basic operations such as creating the dictionary, displaying its contents, searching for a keyword, deleting a keyword, and inserting new keywords.
active 2024-07-04 → 2024-07-04 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-07-04 to 2024-07-04. Pushes: 2 total, peak 2 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 |
|---|---|---|---|---|
| MahmoudAymann2 | 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 — 0 stars here means stars gained during the window, not the repo's star count.