|
140. Reverse a linked list using recursion
Microsoft Interview Questions and Answers
(Continued from previous question...)
140. Reverse a linked list using recursion
Question:
Reverse a linked list using recursion
maybe an answer:
void reverse(node n, node prev) {
if (n == null) { newroot = prev; return; }
reverse(n.next, n);
n.next = prev;
}
call reverse (root, null);
(Continued on next question...)
Other Interview Questions
| 