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.
java tree queue priority-queue data-structures heap adt adt-template data-structures-algorithms dsa pq spq adt-implementations abstract-data-type dynamic-queue resizable-arrays-implemented resizable-arrays-implementation smart-priority-queue optimized-queue
- Updated
Oct 31, 2024 - Java