Join Examsbook
756 0

Q: How would you reverse a doubly-linked list?

  • Show AnswerHide Answer
  • Workspace

Answer :
Explanation :

This problem isn't too hard. You just need to start at the head of the list, and iterate to the end. At each node, swap the values of pNext and pPrev. Finally, set pHead to the last node in the list. Node * pCurrent = pHead, *pTemp; while (pCurrent) {   pTemp = pCurrent->pNext;   pCurrent->pNext = pCurrent->pPrev;   pCurrent->pPrev = temp;     pHead = pCurrent;   pCurrent = temp; }

Are you sure

  Report Error

Please Enter Message
Error Reported Successfully