CpSc 210, Section 1
Assignment 5
June 25, 2000
Due: Monday, June 25 by 7:00 a.m.
Assignment: Writing a method for an extension of Bailey's BinaryTree.
Total point value of assignment: 80 points
Not accepted late.
This assignment is to be done INDIVIDUALLY.
Assignment: Design and implement a class, ExtBinaryTree, which extends Bailey's
BinaryTree class, and implement a boolean method, isBST(), which
returns true if the Binary Tree is a Binary Search Tree, and false,
otherwise.
You may test your method using any Comparable Object, such as Strings,
Integers, or Character -- just don't attempt to mix types. Also, use
the Binary Tree from Chapter 10, not the BinarySearchTree from Chapter 12.
Remember to compare Objects using the compareTo method (page 168).
Grading Rubric:
10 pts. reasonable attempt to solve problem as assigned
10 pts. also compiles
10 pts. style standards (includes clarity)
The following 50 points are available only for code that compiles
and runs without error.
20 pts. works for your testDriver
30 pts. works for our testDriver
Your main method should contain a test program. In addition, at some point in the test program, all code should have been tested.
ExtBinaryTree.java may contain any additional methods that would be helpful. For example, you might write a method to print "CPSC 210", your name, the assignment number, and a brief description of the assignment.
Other requirements:
The first operation of your main program must be to print "CPSC 210", your name, the assignment number, and a brief description of the assignment.
Follow the style standards to be found on your instructor's
web page for CPSC 210.
Submit your program using the handin command. There is a link to
the handin description on the CPSC 210 lab page (www.cs.clemson.edu/~lab210).