Trie Spell Checker

A data structures exercise done properly. Each node in the tree holds one letter and an array of children, with a flag marking the nodes where a complete word ends. Words are inserted letter by letter, and checking a word is a walk down the tree. The checker strips punctuation as it scans so real prose parses rather than only clean word lists.

Attention: Early coursework from 2023. It is small, but it is finished and it works.