CSC 103 Lab Notes Week 3 Getting an Early Start on Assignment 2
Empirical Algorithm Analysis

1. Install a binary plain search tree implementation in the SortedList class. Some starter methods are in the BinarySearchTree.java program in the examples directory.

2. Build a random 500-element binary search tree and print out its maximum depth.