P6GradCrit - Printing out the total number of words works...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Program #6 Grading Criteria Implementation (15 pts) structs outlining a binary tree structure exist: 10 points the number of distinct words and total words isn't recalculated from scratch at each query, instead these values are continually updated as changes are made to the tree: 5 points Execution Points (70 pts) 5 points for each of the following: First insert of a word works Inserting a second word to left works Inserting a second (or third) word to the right works Deleting some copies of a word (but not all) works Deleting all copies of a word deletes the node in the tree Query for the number of times a word appears works for words in the tree Query for the number of times a word appears works for words not in the tree Printing out the distinct number of words works
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Printing out the total number of words works Printing out the depth of a random node in the tree works Printing out the height of the whole tree works Reading from a file with only valid lowercase words works Reading from a file with upper and lowercase words works Reading from a file with non-alphabetic strings also works Note: If some sort of compile or run-time error occurs, feel free to find the error, fix it and deduct points for just the error. Style Points (15 pts) Header comment w/name, program, date 4 pts Appropriate variable names 2 pts Appropriate use of white space 2 pts Appropriate indenting 2 pts Comments in code 5 pts...
View Full Document

Ask a homework question - tutors are online