 The advantages of the fancy variants are often limited to the complexity of the algorithms, not in their efficiency.A circular list, in particular, can usually be emulated by a linear list together with two variables that point to the first and last nodes, at no extra cost.Double-linked lists require more space per node (unless one uses XOR-linking), and their elementary operations are more expensive; but they are often easier to manipulate because they allow fast and easy sequential access to the list in both directions.