CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

AVL: AVL trees and tries.

AVL trees are balanced binary trees. This implementation recreates the tree around the inserted element, without side effects.
Version: AVL trees 1.1 (27-OCT-93); AVL tries 1.1 (4-DEC-93) Ports: Tested in SCM. Should run in R4RS compatible schemes with minor modifications. CD-ROM: Prime Time Freeware for AI, Issue 1-1 Author(s): Stephen Bevan Keywords: AVL Trees, AVL Tries, Authors!Bevan, Scheme!Code, Scheme!Extensions References: ?
Last Web update on Mon Feb 13 10:35:51 1995