Search Trees |

A red-black tree is binary search tree that is roughly balanced, keeping the worst-case time values for operations such as inserting, deleting, and searching proportional to the height of the tree. Left-leaning red-black (LLRB) trees are a simpler version of red-black trees in which all red links must “lean” left except during inserts and deletes. LLRB trees have good worst-case running time for their operations and are efficient in general use.

- llrb-tree-count
- llrb-tree-delete
- llrb-tree-p
- llrb-tree-test
- llrb-tree-value
- make-llrb-tree
- map-llrb-tree

Search Trees |