Double linked list

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

struct node
{
    int info;
    node *prev;
    node *next;
};
node *root=NULL,*tail=NULL;

void create(int data)
{
    node *ptr;
    ptr=new node();
    ptr->prev=NULL;
    ptr->next=NULL;
    ptr->info=data;
    if(root==NULL)
    {
        root=ptr;
        tail=ptr;
    }
    else
    {
        tail->next=ptr;
        ptr->prev=tail;
        tail=ptr;
    }
}
void traverse()
{
    node *srt;
    for(srt=root; ;)
    {
        cout<<srt->info<<endl;
        srt=srt->next;
        if(srt->next==NULL)
            break;
    }
    cout<<srt->info<<endl;
}
insert_first()
{
    int data;
    cin>>data;
    node *ptr;
    ptr=new node();
    ptr->prev=NULL;
    ptr->next=root;
    ptr->info=data;
    root->prev=ptr;
    root=ptr;
}
int main()
{
    int n;
    cin>>n;
    int a[n+5];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        create(a[i]);
    }
    insert_first();
    traverse();
    return 0;
}