©2007 Felleisen, Proulx, et. al.

# 0 Accumulator-Style Program Design

# Etudes

Work out the problems 31.3.3, 31.3.4, 31.3.6, and 31.3.7 in the HtDP textbook.

# Main Assignment

## 0.1 Problem

A list of `Posn`

s represents points on a route we
traverse.

Design the function that computes the total distance of our
traversal.

Design the function that determines the minimum distance between
two consecutive `Posn`

s in this list.

Solution

## 0.2 Problem

A binary search tree of `String`

s represents the names of
students in a class roster.

Design the function that produces a list of all names in the
given binary search tree, arranged in the same order as in the
given binary search tree.

Solution

Last modified: Monday, January 8th, 2007 4:41:03pm