Doubly Linked List Implementation and Printing it in both ways (normal, reverse)

Author: MohammadFahad1

doubly_linked_list.cpp

@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *prev;
+    Node *next;
+    Node(int val)
+    {
+        this->val = val;
+        this->prev = NULL;
+        this->next = NULL;
+    }
+};
+
+void print_normal(Node *head)
+{
+    Node *tmp = head;
+    while (tmp != NULL)
+    {
+        cout << tmp->val << " ";
+        tmp = tmp->next;
+    }
+    cout << endl;
+}
+
+void print_reverse(Node *tail)
+{
+    Node *tmp = tail;
+    while (tmp != NULL)
+    {
+        cout << tmp->val << " ";
+        tmp = tmp->prev;
+    }
+    cout << endl;
+}
+
+int main()
+{
+    Node *head = new Node(10);
+    Node *a = new Node(20);
+    Node *b = new Node(30);
+    Node *tail = b;
+
+    head->next = a;
+    a->prev = head;
+    a->next = b;
+    b->prev = a;
+
+    print_normal(head);
+    print_reverse(tail);
+
+    return 0;
+}

doubly_linked_list.exe

@@ -0,0 +1,2 @@
+10 20 30 
+30 20 10