Microsoft Corporation Question:

How would you reverse a doubly-linked list?

Tweet Share WhatsApp

Answer:

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-gt;pNext;
pCurrent-gt;pNext = pCurrent->pPrev;
pCurrent-gt;pPrev = temp;

pHead = pCurrent;

pCurrent = temp;
}

Download Microsoft PDF Read All 25 Microsoft Questions
Previous QuestionNext Question
Microsoft Interview Questions ListHow could you determine if a linked list contains a cycle in it, and, at what node the cycle starts?