import { RBTree } from "https://deno.land/x/mock@0.15.2/time_deps.ts";
A red-black tree. This is a kind of self-balancing binary search tree. The values are in ascending order by default, using JavaScript's built in comparison operators to sort the values.
Properties
protected
root: RBNode<T> | nullMethods
protected
removeFixup(parent: RBNode<T> | null, current: RBNode<T> | null)Adds the value to the binary search tree if it does not already exist in it. Returns true if successful.
Static Methods
Creates a new red-black tree from an array like or iterable object.