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.
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.