From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.3 required=5.0 tests=BAYES_00,INVALID_MSGID,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c8e8f6fa5e81021f
X-Google-Attributes: gid103376,public
From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: Looking for Information on Symbolized Search Trees
Date: 2000/04/22
Message-ID: <8dsbn2$1v0$1@nnrp1.deja.com>#1/1
X-Deja-AN: 614255691
References: <956391873.399710@karri.southwest.com.au>
X-Http-Proxy: 1.0 x31.deja.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Sat Apr 22 14:07:37 2000 GMT
X-MyDeja-Info: XMYDJUIDrobert_dewar
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.61 [en] (OS/2; I)
Date: 2000-04-22T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <956391873.399710@karri.southwest.com.au>,
  "James Kerr" <jkerr@southwest.com.au> wrote:
> Yeh I am looking for any books or information on Symbolized
Search trees, I
> need to find information on the concepts, advantages and
disadvantages, any
> help would be greatly appreciated.


The term is by no means a standard one (looking it up in the
index of several standard algorithms books yielded null) so
you might want to elaborate the question.


Sent via Deja.com http://www.deja.com/
Before you buy.