Along with a binary search tree, one of these structures is used to store future beach-line-changing events in Fortune's algorithm for generating Voronoi diagrams. The ROAM algorithm uses a pair of these data structures to store triangles that can be either split or merged.  A meldable heap is a version of this structure implemented using a binomial heap, which gives it a "merge" operation, and the "fringe" structure in the A* algorithm is one of these. They're used on network routing protocols to ensure real-time traffic is forwarded first, and they optionally implement the PeekAtNext operation. In Java these structures implement the "comparable" interface, unlike another structure whose interface they implement. For 10 points, name this data structure that unlike a related structure isn'
Along with a binary search tree, one of these structures is used to store future beach-line-changing events in Fortune's algorithm for generating Voronoi diagrams. The ROAM algorithm uses a pair of these data structures to store triangles that can be either split or merged.  A meldable heap is a version of this structure implemented using a binomial heap, which gives it a "merge" operation, and the "fringe" structure in the A* algorithm is one of these. They're used on network routing protocols to ensure real-time traffic is forwarded first, and they optionally implement the PeekAtNext operation. In Java these structures implement the "comparable" interface, unlike another structure whose interface they implement. For 10 points, name this data structure that unlike a related structure isn't first in first out but inserts each element with an associated value of importance.
Along with a binary search tree, one of these structures is used to store future beach-line-changing events in Fortune's algorithm for generating Voronoi diagrams.
{Priority queue}