Question

Given below is a generic List ADT. From this ADT, write three implementations in C++, one using a stack, one using a priority queue, and one using a linked list. bool isEmpty(FloatList list) – returns true if the list is empty, otherwise false. FloatList constructList(float newElement, FloatList oldList) – constructs a new list with copies of all of the elements from oldList and newElement Precondition: oldList is a list with 0 or more elements Postcondition: the list returned by constructList contains newElement float firstElement(floatList list) – returns the first element in the list, but does not remove it Precondition: isEmpty(list) == false Postcondition: none FloatList restOfList(FloatList oldList) – returns a copy of list that contains every element except firstElement(oldList) Precondition: oldList is a list with 1 or more elements Postcondition: newList = restOfList(oldList) newList contains every element in oldList except the first element Note: This is an abstract definition of the operations that the List ADT should perform. It is your job to create classes for this ADT which implement at least these features

Answer 1

Answer:

u ku ki i 5ihejne e eueieneor r ru eh....