Trie: AutoComplete

Tasks

In your data-structures repository, add methods that implement autocomplete.

Your autocomplete should calculate a maximum of the “top” four possibilities for a given subsequence in your token.

For instance:

* K –> [‘kittens’, ‘kits’, ‘kilt’, ‘kaboodle’] * KI –> [‘kittens’, ‘kits’, ‘kilt’] * KIL –> [‘kilt’] * KILT –> [‘kilt’] * KILTE –> [ ] * KILTER –> [ ]

Your implementation must include tests. The tests, as usual for our data structures, must run both in Python 2.7 and Python 3.5.

Add documentation of your new methods to your README file. Include any sources or collaborations.

Submitting Your Work

When you’ve completed your work and all your tests are passing, submit a pull request from the bst branch back to master. Copy the URL for that pull request and submit it using the URL input. When that is done, you may merge your branch back to master. However, do not delete your working branch until your assignment has been graded.

As usual, use the comment function to submit questions, comments and reflections on the work you’ve done here.