Tries: Difference between revisions
Jump to navigation
Jump to search
m (Ovidiu moved page Radix Trees (Tries) to Tries without leaving a redirect) |
No edit summary |
||
| 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]] | ||
Revision as of 01:44, 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