Answered Essay: In the following C program, I want to know how to print out the data values of the nodes, NOT the addre

In the following C program, I want to know how to print out the data values of the nodes, NOT the address as is currently the case.

#include <stdio.h>

#include <stdlib.h>

#include <stdbool.h>

typedef struct queueNode queueNode;

typedef struct queue queue;

struct queueNode

{

void* data_;

queueNode* next_;

};

queueNode* queueNode_create(void* data);

queueNode* queueNode_create_next(void* data, queueNode* next);

//———————————————————–

queueNode* queueNode_create(void *data) {

return queueNode_create_next(data, NULL);

}

//——————————————————-

queueNode* queueNode_create_next(void* data, queueNode* next) {

queueNode* p = (queueNode*)malloc(sizeof(queueNode));

p->data_ = data;

p->next_ = next;

 

return p;

}

void queueNode_print(queueNode* q){ printf(“Data: %p Next: %pn”,q->data_,q->next_); }

struct queue

{

queueNode* head_;

int numitems_;

};

/*

create

empty

check_empty

size

front

back

push_back

pop_front

delete

print

*/

queue* queue_create();

bool queue_empty(queue* q);

void queue_check_empty(queue* q);

int queue_size(queue* q);

void* queue_front(queue* q);

void* queue_back(queue* q);

void queue_push_back(queue* q,void* data);

void queue_pop_front(queue* q);

void queue_print(queue* q);

void queue_delete(queue* q);

queue* queue_create()

{

queue* q = (queue*)malloc(sizeof(queue));

q->numitems_ = 0;

q->head_ = NULL;

return q;

}

bool queue_empty(queue* q) { return q->numitems_ == 0; }

void queue_check_empty(queue* q) { if (queue_empty(q)) { fprintf(stderr, “<empty>n”); } }

int queue_size(queue* q) { return q->numitems_; } //he put returns size_t

void* queue_front(queue* q)

{

queue_check_empty(q);

return q->head_;

}

void* queue_back(queue* q)

{

queue_check_empty(q);

queueNode* temp = q->head_;

while(temp->next_ != NULL) { temp = temp->next_; }

return temp;

}

void queue_push_back(queue* q,void* data)

{

queueNode* node = queueNode_create(data);

if (queue_size(q) == 0) {

q->head_ = node;

}

else {

queueNode* temp = q->head_;

while (temp->next_ != NULL) {

temp = temp->next_;

}

temp->next_ = node;

}

++q->numitems_;

}

void queue_pop_front(queue* q)

{

queue_check_empty(q); //no need to check if empty

 

q->head_ = q->head_->next_;

 

//–q->numitems_;

}

void queue_print(queue* q)

{

queue_check_empty(q);

 

queueNode* temp = q->head_;

 

while(temp->next_ != NULL)

{

queueNode_print(temp);

//printf(“[%p, %p],”, q->data, q->next);

//printf(“%p “, *front);

temp = temp->next_;

}

}

void queue_delete(queue* q)

{

//while(!q->empty()) { qu->pop(); } add this!

free(q);

}

int main(int argc, const char * argv[]) {

 

queue* q = queue_create();

 

 

int i;

for (i = 0; i < 10; ++i) { queue_push_back(q, (void*)(i*2)); }

printf(“Before Popn”);

queue_print(q);

 

queue_pop_front(q);

printf(“After Pop1n”);

queue_print(q);

 

queue_pop_front(q);

printf(“After Pop2n”);

queue_print(q);

 

queue_pop_front(q);

queue_pop_front(q);

queue_pop_front(q);

printf(“After Pop3n”);

queue_print(q);

 

 

queue_delete(q);

 

//for (i = 0; i < 10; ++i) { }

 

 

 

 

return 0;

}

//END

Expert Answer

 

Hi,

This is printing addresses because you are using ‘%p’ in the printf arguement which specifies to print a pointer, once you change that to %d, you are done, please note that, the q->next should remain %p as its a pointer
here, the modified code
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct queueNode queueNode;

typedef struct queue queue;

struct queueNode
{
void* data_;
queueNode* next_;
};

queueNode* queueNode_create(void* data);
queueNode* queueNode_create_next(void* data, queueNode* next);

//———————————————————–
queueNode* queueNode_create(void *data) {
return queueNode_create_next(data, NULL);
}
//——————————————————-
queueNode* queueNode_create_next(void* data, queueNode* next) {
queueNode* p = (queueNode*)malloc(sizeof(queueNode));
p->data_ = data;
p->next_ = next;

return p;
}

void queueNode_print(queueNode* q){ printf(“Data: %d Next: %pn”,q->data_,q->next_); } /*change is here */

struct queue
{
queueNode* head_;
int numitems_;
};

/*
create
empty
check_empty
size
front
back
push_back
pop_front
delete
print
*/

queue* queue_create();
bool queue_empty(queue* q);
void queue_check_empty(queue* q);
int queue_size(queue* q);
void* queue_front(queue* q);
void* queue_back(queue* q);
void queue_push_back(queue* q,void* data);
void queue_pop_front(queue* q);
void queue_print(queue* q);
void queue_delete(queue* q);

queue* queue_create()
{
queue* q = (queue*)malloc(sizeof(queue));
q->numitems_ = 0;
q->head_ = NULL;
return q;
}

bool queue_empty(queue* q) { return q->numitems_ == 0; }

void queue_check_empty(queue* q) { if (queue_empty(q)) { fprintf(stderr, “<empty>n”); } }

int queue_size(queue* q) { return q->numitems_; } //he put returns size_t

void* queue_front(queue* q)
{
queue_check_empty(q);
return q->head_;
}

void* queue_back(queue* q)
{
queue_check_empty(q);
queueNode* temp = q->head_;
while(temp->next_ != NULL) { temp = temp->next_; }
return temp;
}

void queue_push_back(queue* q,void* data)
{
queueNode* node = queueNode_create(data);
if (queue_size(q) == 0) {
q->head_ = node;
}
else {
queueNode* temp = q->head_;
while (temp->next_ != NULL) {
temp = temp->next_;
}
temp->next_ = node;
}
++q->numitems_;
}

void queue_pop_front(queue* q)
{
queue_check_empty(q); //no need to check if empty

q->head_ = q->head_->next_;

//–q->numitems_;
}

void queue_print(queue* q)
{
queue_check_empty(q);

queueNode* temp = q->head_;

while(temp->next_ != NULL)
{
queueNode_print(temp);
//printf(“[%p, %p],”, q->data, q->next);
//printf(“%p “, *front);
temp = temp->next_;
}
}

void queue_delete(queue* q)
{
//while(!q->empty()) { qu->pop(); } add this!
free(q);
}

int main(int argc, const char * argv[]) {

queue* q = queue_create();

int i;
for (i = 0; i < 10; ++i) { queue_push_back(q, (void*)(i*2)); }
printf(“Before Popn”);
queue_print(q);

queue_pop_front(q);
printf(“After Pop1n”);
queue_print(q);

queue_pop_front(q);
printf(“After Pop2n”);
queue_print(q);

queue_pop_front(q);
queue_pop_front(q);
queue_pop_front(q);
printf(“After Pop3n”);
queue_print(q);

queue_delete(q);

//for (i = 0; i < 10; ++i) { }

return 0;
}

Buy Essay
Calculate your paper price
Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

24/7 Customer Support

Our agents are ready to help you around the clock. Please feel free to reach out and enquire about anything.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

STEP 1

Submit Your Essay/Homework Instructions

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

STEP 2

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

STEP 3

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.

STEP 4

Receive your Paper

After Editing, your paper will be sent to you via email.