{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# lab8 - 15-121 FALL 2009[CORTINA/REID-MILLER Lab 8...

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

15-121 FALL 2009 [CORTINA/REID-MILLER] Lab 8 Binary-tree visualization of the Yahoo search engine bot crawling an experimental website. From www.computergraphica.com In this lab, you will implement several recursive methods using binary trees. EXERCISES Download the project Lab8.zip . It contains the binary tree class discussed in lecture. Although this code is given to you, along with the testers for your exercises, you should read through this code carefully after lab to make sure you can write this code yourself. 1. Look at any of the testers and examine the definitions for the seven binary trees. Draw each binary tree on a piece of paper before proceeding on. (All three testers use the same seven binary trees.) Check with your neighbors to make sure you draw the binary trees correctly. 2. Write a method count in the BinaryTree class that returns the number of data values stored in the binary tree. Your method should have the following signature: public int count() Note that this method should not be recursive. It should call another private method that is recursive

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.

{[ snackBarMessage ]}

### Page1 / 2

lab8 - 15-121 FALL 2009[CORTINA/REID-MILLER Lab 8...

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

View Full Document
Ask a homework question - tutors are online