Reverse a linked list

Question

Bindu · Accepted Answer

reverse DoublyLinkedList(node)
{
while(node)

{
printf(node->info);
if(node->previous==Null)
{
printf(node->info);
break;
}
}
}

Bindu · Answer

reverse DoublyLinkedList(node)
{
while(node)

{
printf(node->info);
if(node->previous==Null)
{
printf(node->info);
break;
}
node =node->previous;
}
}

Bindu · Answer

reverse DoublyLinkedList(node)
{
while(node)
{
printf(node->info);
node =node->previous;
if(node->previous==Null)
{
printf(node->info);
break;
}
}
}

Bindu · Answer

reverse SingleLinkedList(node)
{
while(node)
{
previous=node;
node->next=previous;
node=node->next;
} 
}

Yahoo

Domanda di colloquio di Yahoo

Risposte di colloquio

Aziende seguite

Ricerche di lavoro