The following pages address the process of reading links from the first text file and creating the representative forest. It does not deal with finding the lowest common ancestor or other programming issues.

Before I begin, I'd just like to draw attention to a quote on Dr. Sugihara's policies page:

So far I haven't written much code to speak of anyway. These pages contain higher level concepts.. no code or anything.

About the assignment... as I was thinking about the problem I realized that creating the trees by reading the text file (containing two URLs on each line that represent a link) is trickier than I first thought. For instance, is it possible to start inserting nodes into the tree without first determining which node is the root?

Anyhow, I've scanned some of my notes that I used to reach a solution. If you were stuck, I hope this helps. If you already knew how to tackle this problem, you probably came up with something a bit different. In either case, please let me know! E-mail me: allani@hawaii.edu

By the way, I'm sorry the writing is so messy (you'll see as soon as you turn the page). I wasn't thinking that I would be posting these notes as I was making them...

Last modified: 02/20/00