CMU Artificial Intelligence Repository
TREES: Lisp data structures, including Binary Search Trees,
Priority Queues, and Red-Black Trees
Implementation of several tree-based data structures in Common Lisp,
including Binary Search Trees, Priority Queues, and Red-Black Trees.
The file btree.hqx (binhexed stuffit file) contains an
implementation of binary (2,4) trees from Knuth, volume 3, for MCL.
Version: 1.0 beta, 12/26/1992
Ports: CMU CL 16c
Copying: Free use, copying, modification, and distribution.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: firstname.lastname@example.org
Author(s): Marco Antoniotti,
Courant Institute of Mathematical Science
New York University
New York, NY, 10012
Authors!Antoniotti, Binary Search Trees, Courant Institute,
Lisp!Data Structures, Lisp!Extensions, Priority Queues,
Red-Black Trees, Trees
Last Web update on Mon Feb 13 10:29:41 1995