C implementation for quickly retrieve words
Radix Trees or Tries are data structures that provide fast data retrieval, at the cost of highspace consumption. Typically, data values are associated with edges rather than with nodesin Tries, although this may depend on implementation. In this lab you will be implementinga Trie data structure in C to store a dictionary of English words, and use it to quickly retrieve words for an text auto-complete application.
What things you need to install
c language
- Kalana Dhanajaya
See also the list of contributors who participated in this project.
This project is licensed under Unlicense license. This license does not require you to take the license with you to your project.