(Indexed Lists) As presented in the text, linked lists must be searched sequentially. For...

(Indexed Lists) As presented in the text, linked lists must be searched sequentially. For large lists, this can result in poor performance. A common technique for improving list searching performance is to create and maintain an index to the list. An index is a set of pointers to various key places in the list. For example, an application that searches a large list of names could improve performance by creating an index with 26 entries—one for each letter of the alphabet. A search operation for a last name beginning with "Y" would first search the index to determine where the "Y" entries begin and “jump into” the list at that point and search linearly until the desired name was found. This would be much faster than searching the linked list from the beginning. Use the List class of Figs. 19.4–19.5 as the basis of an IndexedList class. Write a program that demonstrates the operation of indexed lists. Be sure to include member functions insertInIndexedList, searchIndexedList and deleteFromIndexedList.

Fig.19.4 ListNode class-template definition.

Fig. 19.5 List class-template definition. (Part 1 of 4.)

Fig. 19.5 List class-template definition. (Part 2 of 4.)

Fig. 19.5 List class-template definition. (Part 3 of 4.)

Fig. 19.5 List class-template definition. (Part 4 of 4.)