class Doubly{ Node first,last,t; static class Node{ int data; Node next; Node prev; } void create(int a[], int n){ first = new Node(); first.data = a[0]; first.next = null; first.prev = null; last = first; for(int i=1;iLength(n)) return; t = new Node(); t.data = x; t.next = null; t.prev = null; if(index==0){ if(n==null){ first = t; } t.next = first; t.prev = null; first = t; } else{ for(int i=0;iLength(n)) return; if(index == 0){ // head first = first.next; if(first!=null){ first.prev = null; } } else{ for(int i=0;i