hw5spec

# hw5spec - ...

This preview shows pages 1–2. Sign up to view the full content.

<?xml version="1.0" encoding="ISO-8859-1" ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <title>CS32 Homework 5, Winter 2010</title> </head> <body> <div align="right"> Winter 2010 CS 32 </div> <div align="center"> <h2>Homework 5</h2> <p> <strong>Time due: 9:00 PM Thursday, March 11</strong> </p> </div> <p> This homework is a good study guide for the final. The final will be open book, open notes. We don't expect you to memorize every last detail of every algorithm, so a skill you should develop is the ability to locate an algorithm in a reference source, trace through it, and understand it. If it's not in exactly the form your application requires, you should be able to adapt it. </p> <ol> <li> <p> Consider the following binary search tree, ordered using the < relationship: </p> <div align="center"> <img src="tree.gif" alt="binary search tree" /> </div> <ol type="a"> <li> <p> Using the simplest binary search tree (BST) insertion algorithm (no

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/08/2010 for the course COM SCI 32 taught by Professor Smallberg during the Spring '07 term at UCLA.

### Page1 / 4

hw5spec - ...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online