Syrian Virtual UniversityCS CI have to implement a circular linked list defined as followss.
I have to implement a circular linked list defined as follows
struct nodeType
{
Type info;
nodeType<Type> *link;
};
// ordered circular linked list
// duplicated values are allowed
template <class Type>
class circularLinkedList
{
public:
const circularLinkedList<Type>& operator=(const
circu
...[Show More]
Syrian Virtual UniversityCS CI have to implement a circular linked list defined as followss.
I have to implement a circular linked list defined as follows
struct nodeType
{
Type info;
nodeType<Type> *link;
};
// ordered circular linked list
// duplicated values are allowed
template <class Type>
class circularLinkedList
{
public:
const circularLinkedList<Type>& operator=(const
circularLinkedList<Type>&);
//Overloads the assignment operator.
void initializeList();
//Initializes the list to an empty state.
//Postcondition: tail = NULL, count = 0
bool isEmptyList() const;
//Function to determine whether the list is empty.
//Postcondition: Returns true if the list is empty; otherwise,
returns false.
void print() const;
//Function to output the data cont
[Show Less]