Abstract
Ordered linked lists are discussed in this chapter. The insert method is created by carefully looking at inserting in the middle, end, and beginning of a linked list, as well as in an empty list. The delete method is examined and is left as an exercise. Doubly linked lists as well as an inner class are introduced and the complete program implements a list of user defined objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2017). Ordered Linked Lists. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)