import * as mod from "https://deno.land/std@0.208.0/data_structures/mod.ts";
Classes
A priority queue implemented with a binary heap. The heap is in descending order by default, using JavaScript's built-in comparison operators to sort the values. | |
An unbalanced binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values. | |
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. |