Instructions

I am providing you with three source codes, BinarySearchTree.java,

TreeNode.java, and RodCut.java. The source code can be found in

the files section of canvas, in a folder named HW$3.$ Please modify the

skeleton code to solve the following tasks.

Recommendation: Separate each task into a new project folder.

BinarySearchTree.java, and TreeNode.java will stay in the same

package folder since BinarySearchTree.java utilizes the class in

TreeNode.java.

$1.$ Implement the inorder$\_$tree$\_$walk$(),$ search$(),$ iterative$\_$search$(),$

minimum$(),$ maximum$(),$ successor$(),$ insert$()$ methods for Binary

Search Trees in BinarySearchTree.java as discussed in lecture.

Follow the pseudocode for implementation.

$2.$ Implement the memoized$\_$cut$\_$rod$(),$ memoized$\_$cut$\_$rod$\_$aux$(),$

bottom$\_$up$\_$cut$\_$rod$()$ methods for RodCut in RodCut.java as

discussed in lecture. Follow the pseudocode for implementation.

$3.$ Extra Credit: uncomment and implement

extended$\_$bottom$\_$up$\_$cut$\_$rod$()$ for RodCut in RodCut.java

Submission:

$1.$ Work individually

$2.$ Submit all codes and report as a last$\_$name.zip file

$3.$ Submit on time, a late submission will receive a penalty of a lowered

letter grade for each day it's late. After three days it's zero.