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;
}

Which operator cannot overload?

1101

---

What is the size of a vector?

1193

---

How do you invoke a base member function from a derived class in which you’ve overridden that function?

1169

---

When does the c++ compiler create temporary variables?

1084

---

What is the difference between global variables and static varables?

1186

---

What is abstract keyword in c++?

1117

---

What is operator overloading in c++ example?

1179

---

What is the use of typedef?

1145

---

Which should be more useful: the protected and public virtuals?

1088

---

Where is atoi defined?

1205

---

What is auto type c++?

1170

---

What is #include math h in c++?

1133

---

What are the advantages of using typedef in a program?

1181

---

What are shallow and deep copy?

1171

---

which one is equivalent to multiplying by 2:Left shifting a number by 1 or Left shifting an unsigned int or char by 1?

1235

---