trie/README.md

trie

Description

Prefix tree implementation written in C.

Table of Contents

• Description
• Features
• Usage
• Credits / Resources
• License

Features / TODOS / NOTES

• DFS
• Node may be a terminated node. Where values are kept as the "key" has ended.
• Node may have n children, where the children are number of possible unique values.
• Maybe strings or bytes etc.
• Efficient generation of completion lists

Usage

Just copy and paste into your projects.

Credits / Resources

Wikipedia - Trie
Jacob Sorber - Tries

License

This project is licensed under GPLv3 - see the LICENSE file for details.