 |
|
Introduction to Computer Science II Homework 7 |
|
Assigned: Friday, Oct 31, 2014 Due: Monday, Nov 10, 2014, at 3pm. |
Homework 7Part I: Course evalYou should receive an email with a link to provide mid-semester feedback. Please do so as it will give us an opportunity to address any problems with and generallyimprove the course.Part II: Implement a Binary Seach TreeImplement a Binary Search Tree. At the minimum your tree should support insert(), remove(), and find(). While insert() and remove() can be implemented iteratively, you will probably find it easier if they are implemented recursively. I recommend starting from the BinaryTree from Lab and addin add insert(), remove() and find().Part III: Implement a iterative tree traversalsImplement pre-order, post-order, in-order and level-order traversals in an iterative fashion using your stacks and queues from the last assignment.Part IV: Timing resultsUse your binary search tree to sort variously sized lists of numbers (insert the numbers then run in-order traversal) and compare the result to your quicksort implementation. Is the iterative or recursive traversal faster?Part V: Written HomeworkWhat to hand inCreate a web page for the assignment. Add a description of your program, graphs and the conclusions you've drawn. Use the CADE online handin system to handin your source code. Please zip and handin your entire project directory (including an info.txt file). If you work in a team only one of you need to submit the source code.GradingEach homework assignment will receive a grade out of 100 points. This week, the available points will be broken down like so:
|