CALIFORNIA STATE POLYTECHNIC UNIVERSITY

Department of Computer Science

CS 240
N.D.
HWK 4
1) ADT Priority Queue
Given the interface to the priority queue. Implement the priority queue data
structure using a single linked chain:
NODE: [address|data]
Items can be compared use COMPARABLE

2) ADT List
a) Create the interface for the List.
b) Implement the List using the interface you completed, part a above, in the
following 2 ways:

i) Fixed Sized Array (Size 10)

ii) Linked Data NODE[address|data]
iii) Double Linked Data NODE[address|data|address]

3) ADT Sorted List

a) Create the interface for the sorted list
b) Implement the Sorted List data structure by inheriting the List Data Structure
you used above!
Implement only one of the data structures from LIST. Use either the single
or double linked data(you choose)

Submit:
1. Please submit your Name, GITHUB link and printout of your code in a doc or pdf
file.