This code represents the array based and the linked-list based ADT implementations in C++. Also both the implementations are extended with functions to find a specific key value in the data structure as well as split the list into two at a particular value.

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.