Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

n-ary/balanced binary trees in Common Lisp

31 views
Skip to first unread message

Greg Menke

unread,
Sep 1, 2002, 2:50:36 PM9/1/02
to

Hi,

Are there reasonably good implementations of either available for
download, or as part of an application? google wasn't coming up with
much for CL.

Thanks,

Greg Menke

Bill Clementson

unread,
Sep 1, 2002, 5:58:24 PM9/1/02
to
Greg Menke <gregm...@toadmail.com> writes:

> Are there reasonably good implementations of either available for
> download, or as part of an application? google wasn't coming up with
> much for CL.

I don't know if the CMU CL repository has something you can use but you
might want to have a look at what's there:
http://www-2.cs.cmu.edu/afs/cs/project/ai-repository/ai/lang/lisp/code/ext/trees/0.html

--
Bill Clementson

Ng Pheng Siong

unread,
Sep 2, 2002, 11:29:28 AM9/2/02
to
According to Greg Menke <gregm...@toadmail.com>:

> Are there reasonably good implementations of either available for
> download, or as part of an application? google wasn't coming up with
> much for CL.

Onshored's ODCL has an AVL tree implementation.


--
Ng Pheng Siong <ng...@netmemetic.com> * http://www.netmemetic.com

Marco Antoniotti

unread,
Sep 2, 2002, 12:44:31 PM9/2/02
to

Bill Clementson <bc1...@attbi.com> writes:

That would be my Red/Black binary tree implementation.

It is not an N-ary balanced tree data structure.

Cheers

--
Marco Antoniotti ========================================================
NYU Courant Bioinformatics Group tel. +1 - 212 - 998 3488
715 Broadway 10th Floor fax +1 - 212 - 995 4122
New York, NY 10003, USA http://bioinformatics.cat.nyu.edu
"Hello New York! We'll do what we can!"
Bill Murray in `Ghostbusters'.

0 new messages