Question

Implement a c++ 'List' class to handle a list with general operations. That means you can insert and delete any element anywhere in the list. The list has no order, except for the order you insert or delete.   The methods you are to implement are as given:

Constructor methods (two, default and copy constructor, a list to a newly defined list, ie 'List listA(listB)' )

empty returns true or false if list is empty or not.

front makes current position at the beginning of the list

end makes current position at the end of a list.

prev places current position at the previous element in the list

next places current position at the next element in the list

getPos returns current position or where you are in the list

setPos(int) places current position in a certain position in the list

insertBefore inserts a new element before the current position

insertAfter inserts a new element after the current position

get Element returns the one element that current position is pointing to

size returns the size of the list (number of elements in list)

replace(int) replace the current element with a new value

erase deletes the current element

clear makes the list an empty list

reverse   reverse elements in a list

swap swaps all the elements of one list with the another list.

overload the operators: (at least)    << output, == , + , = (assignment)

You are to implement the List class using an array. For now the array can be 20 in size.

You will need to use the 'ElementType' for 'typing' your data.

You will need to use CAPACITY constant for the size of the array, in case we need to change the array size.

Invariants: The elements in the list should be left justified.

Answer 1

etti t-t->next; add (n) else if (c<count () ) //calling addafter function addafter(n, ++c) else //calling append function. appendfn); int delete (int n) struct node *t, *prev: t-head; while (t! NULL)

if(t--head) head-t-next free (t); return 1; else prev-next-t-next; free (t) return 1i else preti temp- t-next; return 0i

return ci intmain () int inum; struct node *n; head NULL while (1) printf("n Enter your Choice \n"); p基1ntf ( "1 . Insert\n" ) ; printf ("2.Display\n"); printf( "3 . Size\n") ; printf ("4.Deleteln") printf ( "5.EX1t\n") ; printf ("Enter your choice ¡¡(scanf ("%d"h. A) <=0) ") printf ("Enter only an Integer\n"); exit (0) else

switch i) case 1: pxiatf."Enter the number to insert : ") scanf ( " % d "r &num) ; insert (num) ; break case L if(head-NULL) printf.("List is Empty\n" else printf("Element (s) in the list are display(n); ") 1 S break: case 3: printf("size of the list is %d\n", size()); break:

sase 4: if (head-NULL) printf"List is Empty\n" else printf ("Enter the number to delete scanf("%d" nen) ; if (delete (n) ) ") printf("%d deleted successfully\n",n) ; else Rrintf("%d not found in the list\n",n); break; case 5: return 0 default: printf."Invalid optionln" return 0