next up previous
Next: 2.3 Stacks Up: 2.2 Implementation of Lists Previous: 2.2.2 Pointer Implementation of Lists

2.2.3 Doubly Linked List Implementation

*
makes searches twice as efficient
*
needs as many extra pointers as the number of elements (See Figure 2.4); consequently insertions and deletions are more expensive in terms of pointer assignments


  
Figure 2.4: A doubly linked list
\begin{figure} \centerline{\psfig{figure=figures/Fdllist.ps}} \end{figure}


eEL,CSA_Dept,IISc,Bangalore