CMSC 341 -- Fall 2003 -- Project 3

Copy this file into your directory and edit it to add your answers to the
following questions about project 3.

These questions count for 10% of your project grade.


1. (5 points) What is the time complexity of the find method that you
   implemented?  Consider the general case where the sequences inserted
   into the Trie are not just strings, where the number of different
   values that can be stored in a node is 26.  That is, suppose the number
   of different values that can be stored in a node is V.  Also be sure to
   take into account the length of the sequence to be found, i.e. N.

2. (5 points) You could implement the spelling checker using a BST where
   each node stores a complete word.  Do you think the BST implementation
   or the Trie implementation is more time efficient?  Explain your answer.
   You can compare efficiency in an asymptotic sense or in an empirical
   sense (i.e. not ignoring constants).