Doubly Linked List Implementation Using C++

DoublyLinkedList.cpp

/*              Nasim                   */


#include<bits/stdc++.h>
using namespace std;

class node
{
public:
    int data;
    node *prev;
    node *next;
};

node *Ehead = NULL;

node* NewNode(int n)
{
    node *root = new node();
    root->data = n;
    root->next = NULL;
    root->prev = NULL;
    return root;
}

void InsertAtHead(int n,node **head)
{
    node* root = NewNode(n);
    if ((*head) == NULL)
    {
        (*head)  = root;
        Ehead = root;
        return;
    }
    (*head)->prev = root;
    root->next = (*head);
    (*head) = root;
}

void InsertAtEnd(int n,node **head,node **temp)
{
    node *root = NewNode(n);

    if ((*head) == NULL)
    {
        (*head) = root;
    }
    else
    {
        (*temp) = (*head);
        while ((*temp)->next != NULL)
        {
            (*temp) = (*temp)->next;
        }
        root ->prev = (*temp);
        (*temp)->next = root;
        Ehead = root;
    }
}

void print(node *head)
{
    cout<<"Forward:\n";
    node *root = head;
    while(root != NULL)
    {
        cout<<root->data<<" ";
        root = root->next;
    }
}
void reprint()
{
    cout<<"Reverse:\n";
    node *root = Ehead;
    while (root != NULL)
    {
        cout<<root->data<<" ";
        root = root->prev;
    }
}

int main()
{
    node *head = NULL,*temp = NULL;

    InsertAtHead(34,&head);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtHead(44,&head);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtHead(37,&head);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtEnd(94,&head,&temp);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtHead(3,&head);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtEnd(100,&head,&temp);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    InsertAtHead(4,&head);
    print(head);
    cout<<"\n";
    reprint();
    cout<<"\n\n";

    return 0;
}