package.lisp

   1 (defpackage "BINARY-TREES"
   2   (:use "COMMON-LISP")
   3   (:nicknames #:trees)
   4   (:shadow reduce find delete position)
   5   (:export #:emptyp
   6            #:make-binary-tree
   7
   8            #:binary-tree
   9            #:avl-tree
  10            #:red-black-tree
  11            #:aa-tree
  12
  13            #:insert
  14            #:find
  15            #:delete
  16            #:size
  17            #:minimum
  18            #:maximum
  19            #:select
  20            #:position
  21            #:reduce
  22
  23            #:upper-bound
  24            #:lower-bound
  25
  26            #:dotree
  27            ;#:do-tree-range
  28            ;#:with-tree-iterator
  29
  30            #:pprint-tree))