Q #1. Apply concepts of Advanced Data Structures to implement a template class for array based list with following attributes and functionalities: template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3
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).
Q #1. Apply concepts of Advanced Data Structures to implement a template class for
array based list with following attributes and functionalities:
template <class T>
class ABList{
private:
int max_size;
int actual_size;
T* list_array;
public:
ABList(int Size);
~ABList();
int getLength();
Page 2 of 3
T getItem(int);
void insertItem(T value);
int findAndRemoveItem(T);
void displayList();
void MergeList(ABList);
void ReducetoHalf();
};
• Constructor will dynamically allocate the list of size ‘Size’.
• insertItem() function will insert new item at the end of the list, only if item is not
present in the list already. If item is already present, it will display a message,
‘Item already in the list’.
• FindAndRemoveItem() will search an item in the list, if found, item will be removed
from the list. If item is not found, function will return -1.
• ReducetoHalf() will reduce the size of the List to half and copy all the items from the old
list to the new list and destroy the old list.
• MergeLists() will combine two array based lists into one.
• In main(), define two array based lists of type String and size 10. Ask user to
enter 5 names in each of the lists. Merge both the lists and display the resultant
merged list on the screen.
Step by step
Solved in 6 steps with 6 images
