Skip to main content

Linked Lists

  • Chapter
  • First Online:
Advanced Topics in C
  • 5194 Accesses

Abstract

In this chapter, we will explain the following:

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    This is usually called a self-referencing structure.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Noel Kalicharan

About this chapter

Cite this chapter

Kalicharan, N. (2013). Linked Lists. In: Advanced Topics in C. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-6401-9_4

Download citation

Publish with us

Policies and ethics