Reverse a linked list - both iterative and recursive way.
Anonymous
Node reverse(Node head) { Node temp; Node previous = NULL; while (head != NULL) { temp = head.next; head.next = previous; previous = head; head = temp; } return previous; }
Check out your Company Bowl for anonymous work chats.