In computer science, a queap is a priority queue data structure, composed of a doubly linked list and a 2-4 tree data structure.
In computer science, a queap is a priority queue data structure that points to the smallest stored item. Queap is composed of a doubly linked list and a 2-4 tree data structure.