Tries: Difference between revisions
Jump to navigation
Jump to search
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
=External= | |||
* https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014 | |||
=Internal= | =Internal= | ||
* [[Tree_Concepts#Trie|Tree Concepts]] | * [[Tree_Concepts#Trie|Tree Concepts]] | ||
| Line 7: | Line 10: | ||
* 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 | ||
* Process this: https://github.com/jwasham/coding-interview-university#tries | * Process this: https://github.com/jwasham/coding-interview-university#tries | ||
* https://brilliant.org/wiki/tries/ | |||
* http://ellard.org/dan/www/libsq/cb_1998/c06.pdf | |||
* https://www.youtube.com/watch?v=TRg9DQFu0kU | |||
</font> | </font> | ||
Latest revision as of 01:50, 17 November 2021
External
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
- https://brilliant.org/wiki/tries/
- http://ellard.org/dan/www/libsq/cb_1998/c06.pdf
- https://www.youtube.com/watch?v=TRg9DQFu0kU