Dapp-a-day 21: Trie implementation

View this thread on: d.buzz | hive.blog | peakd.com | ecency.com
·@nexusdev·
0.000 HBD
Dapp-a-day 21: Trie implementation
![dapp-a-day-21 2x](https://cloud.githubusercontent.com/assets/6280810/18256714/69a32db0-73b9-11e6-95dc-c5fab6ba8787.png)

---


Everybody is familiar with trees. You can usually find them in forests, or just alone standing somewhere. Overall they are really useful structures and can help us with a lot of tasks. However, not many of us know what a trie is. **Trie stands short for retrieval, and is a data structure to store and search things, based on their prefix.** 


### https://github.com/nexusdev/trie 

[Here](https://en.wikipedia.org/wiki/Trie) you can learn more why they are useful data structures, here we will focus on their implementation.

We will use our reporer again with a small helper tool called docgen. 

[Get it here](https://www.npmjs.com/package/mhhf-docgen) or with `npm i -g mhhf-docgen`. 

This will render a markdown file to html and use viz.js to render code blocks with dot notation.
Just run `dapple test --report && docgen report.md report.html` to reproduce the report.
👍 , , , , , , , , , , , , , , , , , , , , , , ,