Hi, 
07-Jun-97 16:53:40, Jerry Coffin wrote to Neil Burrows
          Subject: Binary Search Tree
 NB>> Unless your as thick as me and load in a dictionary file which is
 NB>> already in alphabetical order!  :(
 JC> This is still fairly easy to handle as a rule.  Load the data into
 JC> memory in an array, then create your binary tree out of the data
 JC> recursively.
This is true, however it is not the most efficient of methods, as you will
have two copies of every word in memory at the end.
See ya,
Neil Burrows
 Internet: neil@remo.demon.co.uk     *  Web     : 
ttp://www.remo.demon.co.uk/
         : nburrows@cs.strath.ac.uk  *  FidoNet : 2:259/36.19
--- Terminate 4.00/Pro
---------------