Programming Lab Project 5
Page 1
CSC 2720: Data Structures
Project 05
Due: By end of the class on the due date
Points: 100 points
Problem Description:
1. Show the results of adding the following search keys to an initially empty binary
search tree: 10, 5, 6, 13, 15, 8, 14, 7, 12, 4.
2. What ordering of the search keys 10, 5, 6, 13, 15, 8, 14, 7, 12, 4 would result in the
most balanced tree if they were added to an initially empty binary search tree?
3. Write an algorithm that returns the smallest search key in a binary search tree.
iCollege Submission and Grading
After you have completed and thoroughly tested your program, upload and submit the word files to
iCollege under Assessments --> Assignments --> Programming Project 5. Always double check that your
submission was successful on iCollege!
The lab will be graded according to the following guidelines.
• A score between 0 and 100 will be assigned.
• If the source file(s) are not submitted before the specified deadline or if they do not compile, then
a grade of 0 will be assigned.
• Deductions for absences will be deducted in a way consistent with the course syllabus.
• The programs will be evaluated to determine if they output the co
ect Strings.