1.

Create class node

1.1. Define integer data
1.2. Define node next, prev
2. Create class Doubly
2.1. Define node temp, integer j;
2.2. Define method display(node ptr)
2.2.1. Node p=ptr
2.2.2. While p!=ptr, do
Print p.data
P=p.next
2.3. Define method delete(node n1, int pos)
2.3.1. Node pt=n1;
2.3.2. While pt!=null, do
Pt=pt.next
J=j+1
2.3.3. If j-1 < pos, do
Print “Enter valid position”
2.3.4. Else, do
Define int i=0 and node p
If n1==null, do
Print “Empty”
Else, do
If pos ==0, do
N1=n1.next
Else, do
Temp=n1
While i<pos-1, do
Temp= temp.next
I++
P=temp.next
Temp.next=p.next
Call display(n1)
3. Inside main method
3.1. Create object n1 of node class
3.2. N1.data= 10, n1.next=null
3.3. Create object n2 of node class
3.4. N2.data= 20, n1.prev=n1, n1.next=n2
3.5. Create object n3 of node class
3.6. N3.data= 30, n3.prev=n2, n3.next=n3, n3.next=null
3.7. Create object d of Doubly class
3.8. D.display(n1)
3.9. Read position pos to delete from
3.10. D.delete(n1, pos)