In this final iteration of autocomplete, you’ll eliminate the last weakness of t

Question

In this final iteration of autocomplete, you’ll eliminate the last weakness of the previous versions: slow adding of individual words one-at-a-time. To do so, a more advanced data structure is needed: a binary search tree.

Instructions

The following files have been given to you:
1. A C++ header file (autocompleter.h) declaring the Autocompleter class.
2. A text file (words 50000.txt) containing 50000 common English words.
3. A C++ source file (main.cpp) containing a main function with tests.

Download the files at http://andrewwinslow.com/2380/hwAC3/. Create a new C++ source file named autocompleter.cpp that implements the class declared in autocompleter.h, so that main.cpp and autocompleter.cpp compile into a program that runs with no failed tests.

Explanation / Answer

Working on ti .

Updaing soon

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.