From: porkchop@invalid.foo   
      
   Ever worked with binary search trees Bonita?   
      
   I've been playing around with them, or was awhile back at least...   
      
   My criteria was to build nodes alphabetically:   
      
   - Left subtree contains keys less than the node   
      
   - Right subtree contains keys greater than the node   
      
   INSTRUMENTATION   
      
       I   
      / \   
     E   N   
    /   / \   
   A   M   S   
      /   / \   
     I   R   T   
        /     \   
       N       U   
        \     /   
         O   T   
        /     \   
       N       T   
      
   --   
   :wq   
   Mike Sanders   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)