Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!hc!pprg.unm.edu!unmvax!tut.cis.ohio-state.edu!osu-cis!att!ihlpl!canoura
From: canoura@ihlpl.ATT.COM (jlcanoura)
Newsgroups: comp.lang.pascal
Subject: bynary search trees
Keywords: help
Message-ID: <9186@ihlpl.ATT.COM>
Date: 22 Feb 89 02:32:16 GMT
Organization: AT&T Bell Laboratories - Naperville, Illinois
Lines: 34

thanks to all of you who responded about the minimun spanning
trees.

now to get to the point.

does anybody have a program using bynary search trees. that does
the following

1. the bst nodes will have information fields consisting of two
   parts(age,name).
   the tree will be sorted with respect to age. I need to use a linked
   representaion where to the left is "less than" and to the right 
   is greater than.

 the program should do the following.

1. read a line which will contain a new record that should be inserted
   appropriately into the bst. the record will consist of name and age.

2. read a line that contains an age and print out the corresponding
   name.

3. print out all the records in the bst in non decreasing order
   with respect to age ( inorder traversal)

4. print out the current height of the bst

5. read a line that contains two ages and print out all
   the records in between those two ages

any help will be apreciated


                                          ihlpl!canoura