Create ReverseLinkedList.cpp

Array/ReverseLinkedList.cpp

@@ -0,0 +1,81 @@
+// A simple and tail recursive C++ program to reverse
+// a linked list
+#include <bits/stdc++.h>
+using namespace std;
+
+struct Node {
+	int data;
+	struct Node* next;
+};
+
+void reverseUtil(Node* curr, Node* prev, Node** head);
+
+// This function mainly calls reverseUtil()
+// with prev as NULL
+void reverse(Node** head)
+{
+	if (!head)
+		return;
+	reverseUtil(*head, NULL, head);
+}
+
+// A simple and tail-recursive function to reverse
+// a linked list. prev is passed as NULL initially.
+void reverseUtil(Node* curr, Node* prev, Node** head)
+{
+	/* If last node mark it head*/
+	if (!curr->next) {
+		*head = curr;
+
+		/* Update next to prev node */
+		curr->next = prev;
+		return;
+	}
+
+	/* Save curr->next node for recursive call */
+	Node* next = curr->next;
+
+	/* and update next ..*/
+	curr->next = prev;
+
+	reverseUtil(next, curr, head);
+}
+
+// A utility function to create a new node
+Node* newNode(int key)
+{
+	Node* temp = new Node;
+	temp->data = key;
+	temp->next = NULL;
+	return temp;
+}
+
+// A utility function to print a linked list
+void printlist(Node* head)
+{
+	while (head != NULL) {
+		cout << head->data << " ";
+		head = head->next;
+	}
+	cout << endl;
+}
+
+// Driver code
+int main()
+{
+	Node* head1 = newNode(1);
+	head1->next = newNode(2);
+	head1->next->next = newNode(3);
+	head1->next->next->next = newNode(4);
+	head1->next->next->next->next = newNode(5);
+	head1->next->next->next->next->next = newNode(6);
+	head1->next->next->next->next->next->next = newNode(7);
+	head1->next->next->next->next->next->next->next
+		= newNode(8);
+	cout << "Given linked list\n";
+	printlist(head1);
+	reverse(&head1);
+	cout << "\nReversed linked list\n";
+	printlist(head1);
+	return 0;
+}