[Solved] Exercise 2

Exercise 2

• Modify the List class (file list.h so that it has two more functions, which will allow inserts and removes from anywhere in the linked list. Your functions should be called:insertMiddle
• removeMiddle

Your functions should have all the same features as the given insert and remove functions, except that yours each have one extra parameter. The second parameter on each of your functions should be of type int, representing the position at which to insert (or delete). Sample calls for a list of integers:  L.insertMiddle(345, 5);	// attempts to insert the value 345				//  as the 5th item in the list  L.removeMiddle(x, 10);	// attempts to delete the 10th item in the				//  list and captures its value into x.

For insertMiddle, if the position number is larger than the number of items in the list, just insert the item at the back. If it’s too small (i.e. 0 or less), insert at the front. For removeMiddle, return false if the position is invalid (without removing anything).I’ve modified the menu program of Figure 21.5 so that it adds in two more menu options for testing these features. You can use it to test your class: