An implementation of the red-black 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.
 
Michael Fiano 448ca17dfc
Fixed pre/post order walking functions.
5 months ago
src Fixed pre/post order walking functions. 5 months ago
LICENSE First commit. 5 months ago
README.md First commit. 5 months ago
red-black-tree.asd Tell ASDF to block compile the source file on SBCL, due to mutually-recursive structure definitions. 5 months ago

README.md

red-black-tree

An implementation of the red-black tree data structure.

Install

(ql:quickload :red-black-tree)

License

Copyright © 2018-2022 Michael Fiano mail@mfiano.net

Licensed under the MIT License.