Double linked list

note terdiri atas

- data
- pointer prev
- pointer next

* pointer head awal list

Tail akhir list
contoh

public class PnodeD {

private int data;
private PnodeD prev, next;
public Pnode( int x, PnodeD p, PnodeD n)
{
data = x;
prev = p;
next= n;
}
public void setdata (.........)
public void setnext(..........)
public void serprev (..........)
public int getdata()
public PnodeD getnext()
public PnodeD getprev ()

public class DLLint {

private DLLint
head, tail;
public void DLLint ()
{
head=null;
tail= null;
}
public void insertFirst(PnodeD n)
}

if(isEmpty())
{
head=x;
tail #x;
x.setnext(null);
x.setprev(null);
}
else {
x.setnext(head);
head setprev(x);
head= x;

main ()
}
DLLint d = new DLLint ();
PNodeD n;
n=new PNodeD (10,null, null);
d.insertFirst(n);
n=new PNodeD (15, null, null);
d.insertFirst (n);
n= new PNodeD(20, null, null);
d.insertFirst(n);
d.CetakDLL();
D.CetakDLL2();