Question

C++ help

0.1. An ordered linked list of characters has been constructed using the array-based implementation. The following diagram shows the current contents of the array that stores the elements in an alphabetical order in the linked list and an available pool of nodes. Node data next о е м и р first = 5 - п free = 6 о у 1) Write in order the contents (data) of the nodes of the linked list pointed to by first. (Original list) <1> Show the changes in the data and next members of the array and the values of first and free after the letter G is inserted in the linked list pointed to by first so that the new list is in alphabetical order. <3 >

Answer 1

1. The order of the original list

(First)   B   --> D --> F --> I --> T --> (tail)

2. When you insert G, first we have to find a place in the list

Current list (First)   B   --> D --> F --> I -->  T --> (tail)

Free List                    X --> P --> M --> (tail)

Place for G would be in between F & I node. So we will use Head node of free list and insert it in between F & I and update the data value to G. and head of the free list will be moved to P.

List after insertion of G (First)   B   --> D --> F --> G --> I -->   T --> (tail)

Free List would start from P.                   P --> M --> (tail)

Tabular representation as shown in question would be as below for new list:

Node Next Data F 9 -1 1 T P 3 Free =2 3 М -1 4 1 First 5 B 7 G 4 7 0

In case of any query do comment. Please rate your answer. Thanks