Working on Delete at Position in Doubly Linked List

Author: MohammadFahad1

delete_at_position_in_doubly_linked_list.cpp

@@ -0,0 +1,90 @@
+#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;
+}
+
+void insert_tail(Node *&head, Node *&tail, int val)
+{
+    Node *newNode = new Node(val);
+    if (tail == NULL)
+    {
+        head = newNode;
+        tail = newNode;
+        return;
+    }
+    tail->next = newNode;
+    newNode->prev = tail;
+    tail = newNode;
+}
+
+void delete_at_position(Node *head, int pos)
+{
+    Node *tmp = head;
+    for (int i = 1; i < pos; i++)
+    {
+        tmp = tmp->next;
+    }
+    Node *deleteNode = tmp->next;
+    tmp->next = tmp->next->next;
+    tmp->next->prev = tmp;
+    delete deleteNode;
+}
+
+void delete_head(Node *head, int pos)
+{
+    // Node *tmp =
+}
+
+int main()
+{
+    Node *head = NULL;
+    Node *tail = NULL;
+
+    while (true)
+    {
+        int val;
+        cin >> val;
+        if (val == -1)
+            break;
+        insert_tail(head, tail, val);
+    }
+
+    print_normal(head);
+    print_reverse(tail);
+
+    return 0;
+}

insert_at_head_tail_doubly_linked_list.exe

@@ -1,2 +1,2 @@
-10 20 30 40 50 60 80 
-80 60 50 40 30 20 10 
+10 20 30 40 50 60 70 80 
+80 70 60 50 40 30 20 10