|
Take-Home #3 (Binary Tree Methods) |
CMSC 132 |
|
Due Date: Wed April 12, 6:00 pm |
Object-Oriented Programming II |
|
Consider this exercise as a Closed Homework |
Spring 2006 |
Objective
Implement recursive methods for a binary tree..
Overview
For this take-home you will provide recursive implementations for some methods of a binary tree implementation. The binary tree implementation we are using is the one available in the class textbook (Chapter 8, section 8.3). Please see that section for information regarding the methods we have provided.
Documentation for the methods you
are expected to implement can be found at
javadoc documentation.
You must implement your methods using recursion, otherwise you will not receive
any credit. For example, if you pass all the tests but implement the
methods using iteration then you will receive 0 credit for the take-home.
Feel free to add private methods that you understand are necessary to provide a
recursive implementation.
Your project will be graded as follows:
Tests (100 %)
Public JUnit tests (40 %)
Release JUnit tests (60 %)
Submission
Submit your project using the submit project option associated with Eclipse.
Academic Integrity
Please make sure you read the academic integrity section of the syllabus so you understand what is permissible in our programming projects. We want to remind you that we check your project against other students' projects and any case of academic dishonesty will be referred to the University's Office of Judicial Program