Structs§
- A Left Leaning Red-Black tree which supports random access O(log n) and get max O(1) https://tjkendev.github.io/bst-visualization/red-black-tree/left-leaning.html This does not properly handle equal key values like the regular RBTree because this does top-down deletions and does not branch when it finds an equal key, just stops there.
- A Red-Black tree which supports random access O(log n) and get max O(1), but does not require the data to be mutable.