This document is a introduction to doubly linked lists.
A doubly linked list is one where each element has pointers forwards to the next element and backwards to the previous element. The list is circular - the last element points forwards to an anchor point, and the anchor point points back to the last element.
Anchor points are always referred to as headers .
A doubly linked list is useful for maintaining a circular queue of items.
Doubly linked lists involve the creation and use of the classes:
In practice, these classes are almost always used as components of other classes.
Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License v1.0.