Homework 6
In this week's assignment you will practice
- Implementing a binary-search tree.
- Implementing an iterator for a non-linear data structure.
- Testing the correctness of your data structure.
Let's Go!
Both team members should click this button to accept the assignment:
- Accept Starter Code on GitHub
- Use the same team you created in HW4.
- The provided code includes two files
minispell.cppandResponses.mdthat you should ignore for now—we'll only use them at the very end.
You will be developing the TreeStringset class according to the following specifications:
You should keep these open in another browser window or tab for reference.
Steps
- Stubs and Interface
- TreeStringSet Constructors
- Insert and Exists
- Displaying the Tree Structure
- An In-Order Iterator
- Tree (In)equality
- Tree Statistics
- Using Your Search Tree
- Check Your Submission
Resources
Specifications for the data structure you will be implementing:
Textbook
You may also want to review Sections 7.1–7.5, Section 8.3, and Sections 9.1–9.3 of the C++ Primer, 5th Edition.
Piazza!
As always, we encourage you to ask (and answer) questions on Piazza as you work!
Grading
Completing this assignment is worth 100 points and your submission will be graded as follows:
- 7 points: Planning (completeness, not correctness)
- 13 points: Repository Status (Makefile, code compiles, correct files submitted, no cpplint errors)
- 2 points: All team members listed on Gradescope submission
- 20 points: Coding Style
- 23 points: Writing Tests
- 28 points: Implementation Correctness
- 7 points: Written Responses
(When logged in, completion status appears here.)