This repository contains the implementation of a Smarter Priority Queue (SPQ) Abstract Data Type (ADT) using a parameterized heap. The SPQ is designed to support both min-heap and max-heap configurations with dynamic adaptability and efficient management.
javatreequeuepriority-queuedata-structuresheapadtadt-templatedata-structures-algorithmsdsapqspqadt-implementationsabstract-data-typedynamic-queueresizable-arrays-implementedresizable-arrays-implementationsmart-priority-queueoptimized-queue
-
Updated
Oct 31, 2024 - Java