[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell
Subject:    Re: search tree implementations
From:       rlpage () alonzo ! cs ! uoknor ! edu (Rex L !  Page)
Date:       1995-11-16 16:24:58
Message-ID: 199511161624.RAA21264 () animal ! cs ! chalmers ! se
[Download RAW message or body]

Return-Path: haskell-list-request@dcs.gla.ac.uk
Resent-Message-Id: <199511161624.RAA21264@animal.cs.chalmers.se>
From: rlpage@alonzo.cs.uoknor.edu (Rex L. Page)
Subject: Re: search tree implementations
Date: Thu, 16 Nov 1995 09:42:32 -0500 (EST)
To: haskell-dist@dcs.gla.ac.uk
Old-Resent-From: haskell-request@dcs.gla.ac.uk
Errors-To: haskell-request@dcs.gla.ac.uk
Approved: haskell@dcs.gla.ac.uk
Resent-Date:  Thu, 16 Nov 1995 14:48:00 +0000
Resent-From: kh@dcs.gla.ac.uk
Resent-To: haskell-list-dist@dcs.gla.ac.uk


Nice to hear from you, Ben.
I got several responses, one of which was a red-black tree
implementation. Also got B-tree and AVL.

Rex



[prev in list] [next in list] [prev in thread] [next in thread]