1. Consider an ADT list of integers. Write a destructor function that would traverse the list, freeing each node one by one. 2. Consider an ADT list that does not have the itemCount number variable...

1. Consider an ADT list of integers. Write a destructor function that would traverse the list, freeing each node one by one.

2. Consider an ADT list that does not have the itemCount number variable keeping count of number of items in the list. Write a Boolean function isEmpty for this list.

3. Write a method reverse for the ADT list that reverses the order of the data items using three pointers