An implementation of the binary search tree data structure.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 

14 lines
408 B

(asdf:defsystem #:binary-search-tree
:description "An implementation of the binary search tree data structure."
:author "Michael Fiano <mail@mfiano.net>"
:license "MIT"
:homepage "https://git.mfiano.net/mfiano/binary-search-tree"
:version "0.1.0"
:encoding :utf-8
:depends-on
(#:mfiano-utils)
:pathname "src"
:serial t
:components
((:file "package")
(:file "binary-search-tree")))