In this chapter, the class to implement the nodes of a linked list is defined as a struct. The following rewrites the definition of the struct nodeType so that it is declared as a class and the member variables are private. template class nodeType { public: const nodeType& operator=(const nodeType&); //Overload the assignment operator. void setInfo(const Type& elem); //Function to set the info of the node. //Postcondition: info = elem; Type getInfo() const; //Function to return the info of the node. //Postcondition: The value of info is returned. void setLink(nodeType *ptr); //Function to set the link of the node. //Postcondition: link = ptr; nodeType* getLink() const; //Function to return the link of the node. //Postcondition: The value of link is returned. nodeType(); //Default constructor //Postcondition: link = NULL; nodeType(const Type& elem, nodeType *ptr); //Constructor with parameters //Sets info point to the object elem points to and //link is set to point to the object ptr points to. //Postcondition: info = elem; link = ptr nodeType(const nodeType &otherNode); //Copy constructor ~nodeType(); //Destructor private: Type info; nodeType *link; }; Write the definitions of the member functions of the class nodeType. Also write a program to test your class.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
In this chapter, the class to implement the nodes of a linked list is defined as a struct. The following rewrites the definition of the struct nodeType so that it is declared as a class and the member variables are private.
template <class Type>
class nodeType
{
public:
const nodeType<Type>& operator=(const nodeType<Type>&);
//Overload the assignment operator.
void setInfo(const Type& elem);
//Function to set the info of the node.
//Postcondition: info = elem;
Type getInfo() const;
//Function to return the info of the node.
//Postcondition: The value of info is returned.
void setLink(nodeType<Type> *ptr);
//Function to set the link of the node.
//Postcondition: link = ptr;
nodeType<Type>* getLink() const;
//Function to return the link of the node.
//Postcondition: The value of link is returned.
nodeType();
//Default constructor
//Postcondition: link = NULL;
nodeType(const Type& elem, nodeType<Type> *ptr);
//Constructor with parameters
//Sets info point to the object elem points to and
//link is set to point to the object ptr points to.
//Postcondition: info = elem; link = ptr
nodeType(const nodeType<Type> &otherNode);
//Copy constructor
~nodeType();
//Destructor
private:
Type info;
nodeType<Type> *link;
};
Write the definitions of the member functions of the class nodeType.
Also write a program to test your class.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
