Apply concepts of Advanced Data Structures to implement a template class for singly linked list with following attributes and functionalities: template struct Node{ T Data; Node *nextPtr; class LinkedList{ private: int Length; Node *headPtr; public: Linked List(); -LinkedList(); int getlength(); void insertNode(T); void removeNode(T); void Movetolast(int index); void DisplayList(); }; - insertNode(T) will insert a new node at the start of the list - Function removeNode( T) will search a node and if found, delete it from the list.- Copy Constructor: Copy Constructor will make a copy of an existing Linked List - Movetolast (int index) will move a node from an index to the end of the list. - In main(), create a linked lists of type float and ask the user to add 10 values to the list. Move the first two elements in the list to last and display the linked list.
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).
please do not copy from other
ASAP
Step by step
Solved in 4 steps with 7 images