Tries: Difference between revisions
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
<font color=darkkhaki> | <font color=darkkhaki> | ||
* TODO [[CLRS]] page 304, http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3499 | * TODO [[CLRS]] page 304, http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3499 | ||
* https://github.com/jwasham/coding-interview-university#tries | * Process this: https://github.com/jwasham/coding-interview-university#tries | ||
</font> | </font> | ||
Revision as of 20:24, 3 November 2021
Internal
Overview
Radix trees are often called tries, which comes from the middle letters in the word retrieval.
- TODO CLRS page 304, http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3499
- Process this: https://github.com/jwasham/coding-interview-university#tries