Profile of Bucket Tries
Introduction Tries (from retrieval) are one of the most practical data structures with a tree construction in computer science. Tries store string data in leaves of tree. They are often used to store such data so that future retrieval can be made efficient. For example, tries are widely used in algo...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Kharazmi University
2020-08-01
|
| Series: | پژوهشهای ریاضی |
| Subjects: | |
| Online Access: | http://mmr.khu.ac.ir/article-1-2661-en.html |