CSC 148 H1, Winter 2013

Lab 7 (Mar. 5/6)

This document contains the instructions for lab number 7 in CSC 148 H1. To earn your lab mark, you must actively participate in the lab.
We mark you in order to ensure a serious attempt at learning, NOT to make careful critical judgments on the results of your work.

General rules

We will use the same general rules as for the first lab (including pair programming). See the instructions at the beginning of Lab 1 to refresh your memory.

Overview

In this lab, you will explore different ways to write functions for binary search trees.


Binary Search Trees (BSTs)

Step 0: Getting started

When you are done, get ready to begin pair programming.

Step 1: Direct recursion

(Student s1 drives and student s2 navigates.)

When you are done, show your work to your TA and switch roles.

Step 2: Indirect recursion

(Student s2 drives and student s1 navigates.)

When you are done, show your work to your TA and switch roles.

Step 3: Recursive objects

(Student s1 drives and student s2 navigates.)

When you are done, show your work to your TA and switch roles.

Step 4: Iteratively

(Student s2 drives and student s1 navigates.)

If you manage to get this done, show your work to your TA. Then, please stick around to help other students in your lab section!