Answer Posted / prits

Using 3 pointers:
curr, next, result pointers, curr points to current node,
next obviously points to the next node, result points to
the new reversed linked list

void reverse_single_linked_list(struct node** headRef)
{
struct node* result = NULL;
struct node* current = *headRef;
struct node* next;
while (current != NULL)
{
next = current->next; // tricky: note the next node
current->next = result; // move the node onto the result
result = current;
current = next;
}
*headRef = result;
}

what you know about c++?

1163

---

Is sorted c++?

1119

---

Explain the differences between list x; & list x();.

1022

---

What is the best book for c++ beginners?

1050

---

If a base class declares a function to be virtual, and a derived class does not use the term virtual when overriding that class, is it still virtual when inherited by a third-generation class?

1044

---

Why is main an int?

1000

---

What is auto used for in c++?

1057

---

Is main a class in c++?

1012

---

What is the c++ code?

1187

---

What are virtual functions in c++?

1191

---

What are files in c++?

1045

---

What is pointer to member?

1105

---

Write a program using display() function which takes two arguments.

1090

---

Is map thread safe c++?

1086

---

What is lambda expression c++?

1066

---