A simple Spell Check Program based on a dictionary data structure (for storing correctly spelled words) implemented as a AVL-Balanced binary search tree (BST). Allows a user to interact with this data structure by adding new words, searching for existing words, printing all words, writing to and reading from files, and spell checking text files
active 2024-11-14 → 2024-11-14 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-11-14 to 2024-11-14. Pushes: 0 total, peak 0 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
Nobody pushed, opened or commented here in the loaded window — this repo's activity is stars and forks only.
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.