import { RBTree } from "https://deno.land/x/collections@v0.11.0/mod.ts";
A red-black tree. The values are in ascending order by default, using JavaScript's built in comparison operators to sort the values.
Constructors
new
RBTree(compare?: compare<Partial<T>> | compareDefined<Partial<T>>)Properties
protected
root: RBNode<T> | nullMethods
private
removeFixup(parent: RBNode<T> | null, current: RBNode<T> | null)Static Methods
from<T, U, V>(collection: ArrayLike<T> | Iterable<T> | RBTree<T>, options: { Node?: RBNode; compare?: compare<Partial<U>> | compareDefined<Partial<U>>; map: mapDefined<T, U>; thisArg?: V; }): RBTree<U>