Skip to main content

Part of the book series: Undergraduate Texts in Computer Science ((UTCS))

  • 841 Accesses

Abstract

The STL provides a container class template list that is very useful in situations in which we need to frequently insert and remove items in the middle of a container. We looked at simple lists in Chapter 3 and examined the basic insert and removal algorithms there. STL lists provide bidirectional iterators. This means that the list should be built of doubly linked nodes so that we can easily traverse in both directions. We also want to provide after-the-end values for iterators. Therefore, a trailer node after the last actual data node will be useful.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Bergin, J. (1998). Lists. In: Data Structure Programming. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1630-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1630-8_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7223-6

  • Online ISBN: 978-1-4612-1630-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics