https://github.com/dokato/trie

python implementation of trie
https://github.com/dokato/trie

Last synced: 18 days ago
JSON representation

python implementation of trie

• Host: GitHub
• URL: https://github.com/dokato/trie
• Owner: dokato
• Created: 2015-05-05T21:00:39.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2015-05-20T13:55:20.000Z (over 9 years ago)
• Last Synced: 2024-10-16T12:39:40.412Z (2 months ago)
• Language: Python
• Size: 145 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Trie

Simple python implementation of [Trie](http://en.wikipedia.org/wiki/Trie) tree data structure also known as *digital tree*, sometimes *radix tree* or *prefix tree*. Efficient when keeping string clues.

It was done as a part of the semester project for "Algorithms and data structers" subject on University of Warsaw.

___

#### Dictionary

You can use Trie as a dictionary. Dictionary implemented as a 

command line parser *dictparser.py*. Here are some commands:

```

 i word # insert word

 r word # remove word from dictionary

 f word # print lexicographic number

 n l # print lth word

 p pref # print number of words starting with prefix pref

 a # print all words in lexicographic order

 d # print all words in reversed order

```