CS 2401 Assignment #8

Due Date: Monday, April 18 or Tuesday, April 19, depending on the day of your lab.

Objective: The goal of this assignment is to practice the use of binary search trees.

Assignment: Write several recursive methods related to trees:

Main idea. For example, to find a given element in a given tree, we do the following. First, we check whether the tree is empty. If the tree is empty, then the given element is not there, otherwise we compare the given element with the root of the tree:

For extra credit: write similar recursive methods that compute other characteristics of the tree: e.g., total number of elements which are positive or which are even, etc.