Question: typedef struct Node _ s Node; struct Node _ s { void * data; int next; } ; enum ListOutOfBounds { LIST _ OOB _

typedef struct Node_s Node;
struct Node_s {
void* data;
int next;
};
enum ListOutOfBounds {
LIST_OOB_START,
LIST_OOB_END
};
#define LIST_MAX_NUM_HEADS 2
#define LIST_MAX_NUM_NODES 2
typedef struct List_s List;
struct List_s{
Node nodes[LIST_MAX_NUM_NODES];
int size;
int head;
int available;
int current;
};
List* list_create(){
static List lists[LIST_MAX_NUM_HEADS];
static bool initialized = false;
if(!initialized){
for(int i =0; i < LIST_MAX_NUM_HEADS; i++){
lists[i].head =-1;
lists[i].size =0;
lists[i].available =0;
}
initialized = true;
}
for (int i =0; i < LIST_MAX_NUM_HEADS; ++i){
if (lists[i].head ==-1){
return &lists[i];
}
}
return NULL;
}
int List_count(List* pList){
// Ensure pList is not NULL (assert is optional)
assert(pList != NULL);
return pList->size;
}
void* List_first(List* pList){
if (pList == NULL || pList->head ==-1){
pList->current =-1;
return NULL;
}
pList->current = pList->head;
return pList->nodes[pList->head].data;
}
void* List_next(List* pList){
assert(pList != NULL);
if (pList->current ==-1){
return NULL; // No current item
}
int currentNodeIndex = pList->current;
if (pList->nodes[currentNodeIndex].next ==-1){
// If current item is already at the end of the list, move beyond the end
pList->current =-1;
return NULL;
}
pList->current = pList->nodes[currentNodeIndex].next;
return pList->nodes[pList->current].data;
}
void* List_prev(List* pList){
assert(pList != NULL);
if (pList->current ==-1){
return NULL; // No current item
}
int prevNodeIndex = pList->head;
int currentNodeIndex = pList->current;
if (currentNodeIndex == pList->head){
// If current item is at the start of the list, move to before the start
pList->current =-1;
return NULL;
}
while (pList->nodes[prevNodeIndex].next != currentNodeIndex){
prevNodeIndex = pList->nodes[prevNodeIndex].next;
}
pList->current = prevNodeIndex;
return pList->nodes[prevNodeIndex].data;
}
void* List_curr(List* pList){
assert(pList != NULL);
if (pList->current ==-1){
return NULL; // No current item
}
return pList->nodes[pList->current].data;
}
int List_append(List* pList, void* pItem){
assert(pList != NULL);
if (pList->size >= LIST_MAX_NUM_NODES){
return LIST_FAIL; // List is full
}
int newNodeIndex = pList->available;
pList->available = pList->nodes[pList->available].next;
pList->nodes[newNodeIndex].data = pItem;
pList->nodes[newNodeIndex].next =-1; // No next node, as it is the last node
if (pList->size ==0){
pList->head = newNodeIndex;
} else {
int lastNodeIndex = pList->head;
while (pList->nodes[lastNodeIndex].next !=-1){
lastNodeIndex = pList->nodes[lastNodeIndex].next;
}
pList->nodes[lastNodeIndex].next = newNodeIndex;
}
pList->size++;
return LIST_SUCCESS;
}
void List_concat(List* pList1, List* pList2){
assert(pList1!= NULL && pList2!= NULL);
if (pList2->size ==0){
return; // Nothing to concatenate
}
if (pList1->size ==0){
// If the first list is empty, simply copy the second list
*pList1=*pList2;
}
else {
int lastNodeIndex = pList1->head;
while (pList1->nodes[lastNodeIndex].next !=-1){
lastNodeIndex = pList1->nodes[lastNodeIndex].next;
}
pList1->nodes[lastNodeIndex].next = pList2->head;
}
// Update the size of the first list
pList1->size += pList2->size;
// Reset the second list
pList2->head =-1;
pList2->size =0;
pList2->available =0;
pList2->current =-1;
}
void printList(List* pList){
assert(pList != NULL);
printf("List: ");
int currentNodeIndex = pList->head;
while (currentNodeIndex !=-1){
printf("%d ",*((int*)pList->nodes[currentNodeIndex].data));
currentNodeIndex = pList->nodes[currentNodeIndex].next;
}
printf("
");
}
int main(){
List* myList = list_create();
List* myList2= list_create();
int items[]={10,20,30,40,50,60,70,80,90};
int numItems = sizeof(items)/ sizeof(items[0]);
// Append items in a loop
for (int i =0; i < numItems; ++i){
if (List_append(. fix this code

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

#include #include #include "llist.h" /* Private node ADT. */ typedef struct _node node; struct _node { node * next; void * e; }; static node * newNode(void * e) { node * n = malloc(sizeof(node)); if...

Q:

Background A linked list implementation of a memory allocation system is described in the OSTEP text book, section 17.2: http:/lpages.cs.wisc.edu/remzi/OSTEP/vm-freespace.pdf A summary is described...

Q:

Problem 1 : Exercise 8 . 1 8 ( with one change as mentioned below ) Instead of having a return type of void, your zip should return an integer: 0 if execution is successful and - 1 for malformed /...

Q:

How can I replace a node in a (custom) Singly LinkedList with a (custom) Singly LinkedList? Let's say that the CustomLinkedList listVar has the enumName_t data in it like SOUTH -> EAST -> WEST ->...

Q:

How can I replace a node in a (custom) Singly LinkedList with a (custom) Singly LinkedList? Let's say that the CustomLinkedList listVar has the enumName_t data in it like SOUTH -> EAST -> WEST ->...

Q:

How can I replace a node in a (custom) Singly LinkedList with a (custom) Singly LinkedList? Note: The exact below CustomLinkedList Class below must be used to complete this. Let's say that the...

Q:

Uplc NOT File Mai Q5 [16M]. The function Interchange () takes the address of the first node of a singly linked list and interchange the first and the last node. For example, if the linked list is:...

Q:

to define a function (named insert_asc) using what we just learnt, to traverse a linked list with double pointer to insert a value into the linked list in ascending order Assume: we already have the...

Q:

To define a function named remove to remove all nodes with same value as the input Assume: we already have the setup as below: Typedef struct node node; struct node { int data; node *next; } Eg,...

Q:

This is a function to reverse a linked list recursively. Can someone please explain to me how this works? 1 typedef struct node 2 3 4 ) node; int data; struct node * next 6 node* eFunction (node*...

Q:

A 100.0-mL sample of spring water was treated to convert any iron present to Fe2+. Addition of 25.00-mL of 0.002517 M K2Cr2O7 resulted in the reaction 6Fe2C 7H2O

Q:

Suppose the Capital Asset Pricing Model (CAPM) holds. The market premium is 8% and the standard deviation of the market portfolio is 20%. Stock A has a beta of 2 and Stock B has a beta of 1. The risk...

Q:

Suppose you are analysing the MNO mutual fund. As part of your analysis, you regress MNO's monthly returns for the past five years against the three factors of the famous Fama and French model. This...

Q:

Click the "draw structure" button to launch the drawing utility. What dihalide is formed when the alkene is treated with Br2 ? CH2=CHCH2CH2CH2CH3

Q:

In the Data Source View in Visual Studio, what option is available to view data in any Source View Table? What are the primary uses this capability?

Q:

What Microsoft Analysis Services Extension for Visual Studio 2017 needs to be installed before beginning work on a Multidimensional OLAP Cube Project? How can the installation be verified?

Q:

Why would the FedScope Employment database be more representative of the General Population in terms of Salary Data than the CPS studies?